id:A057601 - OEIS Search Results

Search: id:A057601

Displaying 1-1 of 1 results found.

page 1

a(0) = a(1) = 1; a(n+1) = number of partitions of n into a(k)'s, 0 <= k <= n, each k occurring at most once.

+0
1

1, 1, 2, 2, 4, 4, 6, 8, 10, 11, 12, 14, 17, 21, 25, 29, 33, 37, 43, 49, 54, 59, 66, 72, 80, 89, 98, 106, 116, 126, 137, 148, 161, 174, 187, 200, 216, 232, 248, 266, 284, 302, 321, 344, 367, 391 (list; graph; listen)

	OFFSET	`0,3`
	EXAMPLE	`a(6) = 6 because 5 = a(0) + a(4) = a(0) + a(5) = a(1) + a(4) = a(1) + a(5) = a(0) + a(2) + a(3) = a(1) + a(2) + a(3).`
	CROSSREFS	`Sequence in context: A027188 A089076 A123067 this_sequence A087135 A094858 A029940` `Adjacent sequences: A057598 A057599 A057600 this_sequence A057602 A057603 A057604`
	KEYWORD	`nonn`
	AUTHOR	`Leroy Quet (qq-quet(AT)mindspring.com), Oct 06 2000`
	EXTENSIONS	`More terms from Naohiro Nomoto (n_nomoto(AT)yabumi.com), Oct 28 2001`

page 1

Search completed in 0.002 seconds

Last modified November 21 14:49 EST 2008. Contains 150807 sequences.

AT&T Labs Research