id:A161104 - OEIS Search Results

Search: id:A161104

Displaying 1-1 of 1 results found.

page 1

Number of partitions of n into nonzero triangular numbers where every part appears at least 3 times

+0
1

0, 0, 1, 1, 1, 1, 1, 1, 2, 1, 1, 3, 2, 2, 4, 3, 3, 6, 4, 4, 7, 6, 6, 9, 7, 7, 11, 9, 9, 15, 11, 11, 18, 15, 15, 22, 18, 18, 27, 23, 22, 33, 28, 28, 41, 34, 34, 49, 42, 42, 56, 51, 51, 68, 60, 59, 79, 72, 71, 94, 83, 84, 111, 100, 100, 127, 117, 118, 147, 136, 135, 171, 158, 158, 199, 183, 183 (list; graph; listen)

	OFFSET	`1,9`
	LINKS	`Ron Hardin, Table of n, a(n) for n=1..1000`
	CROSSREFS	`Sequence in context: A029259 A159266 A161065 this_sequence A110248 A094340 A058636` `Adjacent sequences: A161101 A161102 A161103 this_sequence A161105 A161106 A161107`
	KEYWORD	`nonn`
	AUTHOR	`Ron Hardin (rhhardin(AT)att.net) Jun 02 2009`

page 1

Search completed in 0.002 seconds

Last modified November 27 14:50 EST 2009. Contains 167570 sequences.

AT&T Labs Research