id:A143773 - OEIS Search Results

Search: id:A143773

Displaying 1-1 of 1 results found.

page 1

Number of partitions of n such that every part is divisible by number of parts.

+0
2

1, 1, 1, 2, 1, 2, 1, 3, 2, 3, 1, 5, 1, 4, 3, 6, 1, 8, 1, 7, 5, 6, 1, 14, 2, 7, 8, 11, 1, 17, 1, 14, 11, 9, 3, 29, 1, 10, 15, 23, 1, 28, 1, 23, 25, 12, 1, 51, 2, 20, 25, 32, 1, 44, 11, 39, 31, 15, 1, 94, 1, 16, 40, 52, 19, 64, 1, 57, 45, 44, 1, 126, 1, 19, 83, 74, 6, 90, 1, 124, 63, 21, 1, 186 (list; graph; listen)

	OFFSET	`1,4`
	FORMULA	`G.f.: Sum(x^(k^2)/Product(1-x^(k*i),i=1..k),k=1..infinity).`
	PROGRAM	`(PARI) Vec(sum(k=1, 20, x^(k^2)/prod(i=1, k, 1-x^(k*i)+O(x^400)))) [From Max Alekseyev (maxale(AT)gmail.com), May 03 2009]`
	CROSSREFS	`Sequence in context: A060682 A093873 A161148 this_sequence A053279 A046800 A027350` `Adjacent sequences: A143770 A143771 A143772 this_sequence A143774 A143775 A143776`
	KEYWORD	`easy,nonn`
	AUTHOR	`Vladeta Jovovic (vladeta(AT)eunet.yu), Aug 31 2008`
	EXTENSIONS	`More terms from Max Alekseyev (maxale(AT)gmail.com), May 03 2009`

page 1

Search completed in 0.002 seconds

Last modified December 2 11:54 EST 2009. Contains 167921 sequences.

AT&T Labs Research