login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A097359 a(n) is the number of partitions of n into parts not greater than A020639(n). 2
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 (list; graph; refs; listen; history; text; internal format)
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: A323952 A168140 A088100 * A208525 A209574 A079387

Adjacent sequences:  A097356 A097357 A097358 * A097360 A097361 A097362

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller, Aug 09 2004

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 16 21:59 EST 2019. Contains 320200 sequences. (Running on oeis4.)