A097359 a(n) is the number of partitions of n into parts not greater than A020639(n).

1, 2, 3, 3, 7, 4, 15, 5, 12, 6, 56, 7, 101, 8, 27, 9, 297, 10, 490, 11, 48, 12, 1255, 13, 377, 14, 75, 15, 4565, 16, 6842, 17, 108, 18, 1115, 19, 21637, 20, 147, 21, 44583, 22, 63261, 23, 192, 24, 124754, 25, 16475, 26, 243, 27, 329931, 28, 5260, 29, 300, 30, 831820, 31

Offset

1,2

Comments

a(n) = A000041(n) iff n=1 or n is prime. [corrected by Robert Israel, Sep 04 2018]

a(2*n) = n+1.

Links

Robert Israel, Table of n, a(n) for n = 1..10000

Maple

f:= n -> combinat:-numbpart(n, min(numtheory:-factorset(n))):
f(1):= 1:
map(f, [$1..100]); # Robert Israel, Sep 04 2018

Crossrefs

Cf. A000041, A020639, A097360.

Sequence in context: A168140 A333699 A088100 * A358182 A208525 A342878

Adjacent sequences: A097356 A097357 A097358 * A097360 A097361 A097362

Keyword

nonn

Author

Reinhard Zumkeller, Aug 09 2004

Status

approved