login

The OEIS is supported by the many generous donors to the OEIS Foundation.  

 
Logo  

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)

Revision History for A053258

(Underlined text is an addition; strikethrough text is a deletion.)

Showing entries 1-10 | older changes
A053258 Coefficients of the '5th-order' mock theta function phi_0(q).
(history; published version)
#28byAlois P. Heinz at Tue Feb 02 21:58:47 EST 2021
STATUS

proposed

approved

#27byJon E. Schoenfield at Tue Feb 02 20:40:19 EST 2021
STATUS

editing

proposed

#26byJon E. Schoenfield at Tue Feb 02 20:40:17 EST 2021
NAME

Coefficients of the '5th -order' mock theta function phi_0(q)).

REFERENCES

Srinivasa Ramanujan, Collected Papers, Chelsea, New York, 1962, pp. 354-355.

Srinivasa Ramanujan, The Lost Notebook and Other Unpublished Papers, Narosa Publishing House, New Delhi, 1988, pp. 19, 22, 23, 25.

FORMULA

G.f.: phi_0(q) = sum for Sum_{n >= >=0 of } q^n^2 (1+q)(1+q^3)...(1+q^(2n-1)).

a(n) = ) is the number of partitions of n into odd parts such that each occurs at most twice and if k occurs as a part then all smaller positive odd numbers occur.

CROSSREFS

Other '5th -order' mock theta functions are at A053256, A053257, A053259, A053260, A053261, A053262, A053263, A053264, A053265, A053266, A053267.

STATUS

approved

editing

#25byVaclav Kotesovec at Wed Jun 12 03:11:28 EDT 2019
STATUS

editing

approved

#24byVaclav Kotesovec at Wed Jun 12 03:11:19 EDT 2019
FORMULA

a(n) ~ sqrt(phi) * exp(Pi*sqrt(n/30)) / (2*5^(1/4)*sqrt(n)), where phi = A001622 = (1+sqrt(5))/2 is the golden ratio. - Vaclav Kotesovec, Jun 12 2019

STATUS

approved

editing

#23byOEIS Server at Tue Jun 11 17:29:21 EDT 2019
LINKS

Vaclav Kotesovec, <a href="/A053258/b053258_2.txt">Table of n, a(n) for n = 0..10000</a> (terms 0..1000 from G. C. Greubel)

#22byVaclav Kotesovec at Tue Jun 11 17:29:21 EDT 2019
STATUS

editing

approved

Discussion
Tue Jun 11 17:29
OEIS Server: Installed new b-file as b053258.txt.  Old b-file is now b053258_2.txt.
#21byVaclav Kotesovec at Tue Jun 11 13:15:10 EDT 2019
LINKS

G. C. GreubelVaclav Kotesovec, <a href="/A053258/b053258_2.txt">Table of n, a(n) for n = 0..100010000</a>> (terms 0..1000 from G. C. Greubel)

#20byVaclav Kotesovec at Tue Jun 11 13:10:54 EDT 2019
MATHEMATICA

nmax = 100; CoefficientList[Series[Sum[x^(k^2)*Product[1+x^(2*j-1), {j, 1, k}], {k, 0, Floor[Sqrt[nmax]]}], {x, 0, nmax}], x] (* Vaclav Kotesovec, Jun 11 2019 *)

STATUS

approved

editing

#19byOEIS Server at Tue Apr 03 08:12:50 EDT 2018
LINKS

G. C. Greubel, <a href="/A053258/b053258_1.txt">Table of n, a(n) for n = 0..1000</a>




Lookup |  Welcome |  Wiki |  Register |   Music |  Plot 2 |  Demos |  Index |  Browse |  More |  WebCam  
Contribute new seq. or comment |  Format |  Style Sheet |  Transforms |  Superseeker |  Recents  
The OEIS Community |  Maintained by The OEIS Foundation Inc.  


License Agreements, Terms of Use, Privacy Policy.  .  


Last modified July 13 15:41 EDT 2024. Contains 374284 sequences. (Running on oeis4.)