id:A161070 - OEIS Search Results

Search: id:A161070

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 8 times

+0
1

0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 2, 3, 2, 3, 4, 3, 4, 5, 4, 5, 6, 5, 6, 7, 6, 7, 8, 7, 8, 9, 8, 9, 10, 9, 11, 11, 10, 11, 12, 11, 12, 14, 13, 14, 15, 14, 15, 16, 16, 17, 18, 17, 18, 19, 18, 20, 21, 20, 22, 22, 21, 23, 24, 23, 25, 26, 25, 27, 28, 28, 30, 31, 31 (list; graph; listen)

	OFFSET	`1,24`
	LINKS	`Ron Hardin, Table of n, a(n) for n=1..1000`
	CROSSREFS	`Sequence in context: A091304 A049847 A025431 this_sequence A161109 A161044 A029325` `Adjacent sequences: A161067 A161068 A161069 this_sequence A161071 A161072 A161073`
	KEYWORD	`nonn`
	AUTHOR	`Ron Hardin (rhhardin(AT)att.net) Jun 02 2009`

page 1

Search completed in 0.002 seconds

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.

AT&T Labs Research