id:A161265 - OEIS Search Results

Search: id:A161265

Displaying 1-1 of 1 results found.

page 1

Number of partitions of n into central polygonal numbers A000124 where every part appears at least 12 times

+0
1

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 3, 2, 4, 3, 5, 4, 6, 5, 7, 6, 8, 7, 10, 8, 10, 9, 12, 10, 12, 11, 14, 12, 14, 13, 17, 15, 17, 16, 20, 18, 20, 19, 23, 21, 23, 22, 27, 24, 27, 25, 31, 27, 31, 28, 35, 30, 35, 31, 41, 34, 41, 36, 47, 40, 49, 44, 56, 48, 59, 52 (list; graph; listen)

	OFFSET	`1,24`
	LINKS	`Ron Hardin, Table of n, a(n) for n=1..1000`
	CROSSREFS	`Sequence in context: A160983 A161237 A161061 this_sequence A161290 A161317 A161251` `Adjacent sequences: A161262 A161263 A161264 this_sequence A161266 A161267 A161268`
	KEYWORD	`nonn`
	AUTHOR	`Ron Hardin (rhhardin(AT)att.net) Jun 06 2009`

page 1

Search completed in 0.002 seconds

Last modified December 10 12:37 EST 2009. Contains 170569 sequences.

AT&T Labs Research