The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A092314

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A092314

Sum of smallest parts of all partitions of n into odd parts.
(history; published version)

#17 by OEIS Server at Sun Jul 07 03:17:41 EDT 2019

LINKS

Vaclav Kotesovec, <a href="/A092314/b092314_1.txt">Table of n, a(n) for n = 1..2500</a>

#16 by Vaclav Kotesovec at Sun Jul 07 03:17:41 EDT 2019

STATUS

editing

approved

Discussion

Sun Jul 07

03:17

OEIS Server: Installed new b-file as b092314.txt.  Old b-file is now b092314_1.txt.

#15 by Vaclav Kotesovec at Sun Jul 07 03:17:33 EDT 2019

FORMULA

a(n) ~ exp(Pi*sqrt(n/3)) / (4 * 3^(1/4) * n^(3/4)). - Vaclav Kotesovec, Jul 07 2019

#14 by Vaclav Kotesovec at Sun Jul 07 03:01:47 EDT 2019

LINKS

Vaclav Kotesovec, <a href="/A092314/b092314_1.txt">Table of n, a(n) for n = 1..10002500</a>

STATUS

approved

editing

#13 by Vaclav Kotesovec at Sat Jul 06 09:41:23 EDT 2019

STATUS

editing

approved

#12 by Vaclav Kotesovec at Sat Jul 06 09:37:51 EDT 2019

LINKS

Vaclav Kotesovec, <a href="/A092314/b092314.txt">Table of n, a(n) for n = 1..1000</a>

#11 by Vaclav Kotesovec at Sat Jul 06 08:57:05 EDT 2019

MATHEMATICA

nmax = 50; Rest[CoefficientList[Series[Sum[(2*n - 1)*x^(2*n - 1) / Product[(1 - x^(2*k - 1)), {k, n, nmax}], {n, 1, nmax}], {x, 0, nmax}], x]] (* Vaclav Kotesovec, Jul 06 2019 *)

STATUS

approved

editing

#10 by Joerg Arndt at Wed Jan 23 02:31:59 EST 2019

STATUS

reviewed

approved

#9 by Michel Marcus at Wed Jan 23 01:58:23 EST 2019

STATUS

proposed

reviewed

#8 by Jon E. Schoenfield at Tue Jan 22 23:27:50 EST 2019

STATUS

editing

proposed