id:A151570 - OEIS Search Results

Search: id:A151570

Displaying 1-1 of 1 results found.

page 1

a(0)=1, a(1)=1; a(2^i+j)=a(j)+a(j+1) for 0 <= j < 2^i.

+0
16

1, 1, 2, 3, 2, 3, 5, 5, 2, 3, 5, 5, 5, 8, 10, 7, 2, 3, 5, 5, 5, 8, 10, 7, 5, 8, 10, 10, 13, 18, 17, 9, 2, 3, 5, 5, 5, 8, 10, 7, 5, 8, 10, 10, 13, 18, 17, 9, 5, 8, 10, 10, 13, 18, 17, 12, 13, 18, 20, 23, 31, 35, 26, 11, 2, 3, 5, 5, 5, 8, 10, 7, 5, 8, 10, 10, 13, 18, 17, 9, 5, 8, 10, 10, 13, 18, 17, 12 (list; graph; listen)

	OFFSET	`0,3`
	COMMENT	`Equals A118977 + A151702.`
	CROSSREFS	`For the recurrence a(2^i+j) = Ca(j) + Da(j+1), a(0) = A, a(1) = B for following values of (A B C D) see: (0 1 1 1) A118977, (1 0 1 1) A151702, (1 1 1 1) A151570, (1 2 1 1) A151571, (0 1 1 2) A151572, (1 0 1 2) A151703, (1 1 1 2) A151573, (1 2 1 2) A151574, (0 1 2 1) A160552, (1 0 2 1) A151704, (1 1 2 1) A151568, (1 2 2 1) A151569, (0 1 2 2) A151705, (1 0 2 2) A151706, (1 1 2 2) A151707, (1 2 2 2) A151708.` `Sequence in context: A046147 A052369 A110976 this_sequence A059036 A163466 A085207` `Adjacent sequences: A151567 A151568 A151569 this_sequence A151571 A151572 A151573`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), May 25 2009`

page 1

Search completed in 0.002 seconds

Last modified December 8 08:31 EST 2009. Contains 170430 sequences.

AT&T Labs Research