OFFSET
1,2
COMMENTS
In other words, sum of the smallest parts of all partitions of the head of the last section of the set of partitions of n.
Only one of the smallest parts is used in the sum.
LINKS
Vaclav Kotesovec, Table of n, a(n) for n = 1..10000
FORMULA
a(n) ~ Pi * exp(Pi*sqrt(2*n/3)) / (6*sqrt(2)*n^(3/2)) * (1 + (11*Pi/(24*sqrt(6)) - 3*sqrt(3/2)/Pi)/sqrt(n)). - Vaclav Kotesovec, Jan 03 2019, extended Jul 06 2019
MATHEMATICA
Table[Total[{Min /@ IntegerPartitions[n, All, Range[2, n]]}, 2], {n, 55}] (* Robert Price, Aug 30 2020 *) (* Only suitable for n<100 *)
PROG
(PARI) my(N=66, z='z+O('z^N)); gf=sum(k=1, N, k * z^k / prod(j=k, N, 1-z^j ) ) - z/eta(z); concat([0], Vec(gf)) \\ Joerg Arndt, Aug 31 2020
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Omar E. Pol, Nov 28 2010
STATUS
approved