id:A097359 - OEIS Search Results

Search: id:A097359

Displaying 1-1 of 1 results found.

page 1

Number of partitions of n into parts not greater than the smallest prime factor of n.

+0
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; listen)

	OFFSET	`1,2`
	COMMENT	`a(n) = n iff n=1 or n is prime: a(A000040(n)) = A000041(n);` `a(2*n) = n+1.`
	CROSSREFS	`Cf. A020639, A000041, A097360.` `Sequence in context: A056225 A105437 A088100 this_sequence A079387 A141061 A076557` `Adjacent sequences: A097356 A097357 A097358 this_sequence A097360 A097361 A097362`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Aug 09 2004`

page 1

Search completed in 0.002 seconds

Last modified December 13 23:45 EST 2009. Contains 170824 sequences.

AT&T Labs Research