id:A161065 - OEIS Search Results

Search: id:A161065

Displaying 1-1 of 1 results found.

page 1

Number of partitions of n into powers of two minus one 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, 5, 4, 4, 7, 5, 5, 8, 7, 7, 9, 9, 8, 11, 10, 10, 14, 12, 13, 16, 15, 15, 19, 19, 18, 23, 22, 22, 27, 26, 27, 31, 32, 32, 36, 36, 37, 43, 41, 43, 49, 48, 49, 57, 56, 56, 65, 64, 65, 73, 72, 74, 82, 82, 83, 92, 92, 93, 105, 102, 105, 117, 115, 118 (list; graph; listen)

	OFFSET	`1,9`
	LINKS	`Ron Hardin, Table of n, a(n) for n=1..1000`
	CROSSREFS	`Sequence in context: A029308 A029259 A159266 this_sequence A161104 A110248 A094340` `Adjacent sequences: A161062 A161063 A161064 this_sequence A161066 A161067 A161068`
	KEYWORD	`nonn`
	AUTHOR	`Ron Hardin (rhhardin(AT)att.net) Jun 02 2009`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research