id:A004065 - OEIS Search Results

Search: id:A004065

Displaying 1-1 of 1 results found.

page 1

Define predecessors of n, P(n), to consist of numbers whose binary representation is obtained from that of n by replacing 10 by 01 or changing a final 1 to a 0; then a(0)=1, a(n) = Sum f(P(n)), n>0.

+0
2

1, 1, 1, 1, 1, 2, 2, 2, 1, 3, 5, 7, 5, 12, 12, 12, 1, 4, 9, 16, 14, 42, 54, 66, 14, 56, 110, 176, 110, 286, 286, 286, 1, 5, 14, 30, 28, 100, 154, 220, 42, 198, 462, 858, 572, 1716, 2002, 2288, 42, 240, 702, 1560, 1274, 4550, 6552, 8840, 1274, 5824, 12376 (list; graph; listen)

	OFFSET	`0,6`
	EXAMPLE	`E.g. 201 = 11001001, so P(201) = {169, 197, 200}, f(201) = f(169) + f(197) + f(200).`
	CROSSREFS	`A003121(n) = a(2^n-1).` `Sequence in context: A103626 A026268 A089258 this_sequence A127496 A144393 A089400` `Adjacent sequences: A004062 A004063 A004064 this_sequence A004066 A004067 A004068`
	KEYWORD	`nonn`
	AUTHOR	`David W. Wilson (davidwwilson(AT)comcast.net) Jan 29 2000`

page 1

Search completed in 0.002 seconds

Last modified November 24 23:16 EST 2009. Contains 167481 sequences.

AT&T Labs Research