|
Search: id:A151568
|
|
|
| A151568 |
|
a(0)=1, a(1)=1; a(2^i+j)=2*a(j)+a(j+1) for 0 <= j < 2^i. |
|
+0
16
|
|
| 1, 1, 3, 5, 3, 5, 11, 13, 3, 5, 11, 13, 11, 21, 35, 29, 3, 5, 11, 13, 11, 21, 35, 29, 11, 21, 35, 37, 43, 77, 99, 61, 3, 5, 11, 13, 11, 21, 35, 29, 11, 21, 35, 37, 43, 77, 99, 61, 11, 21, 35, 37, 43, 77, 99, 69, 43, 77, 107, 117, 163, 253, 259, 125, 3, 5, 11, 13, 11, 21, 35, 29, 11
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
Equals A160552+A151704.
|
|
CROSSREFS
|
For the recurrence a(2^i+j) = C*a(j) + D*a(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.
Cf. A139250, A160552, A151569.
Sequence in context: A020765 A112756 A121795 this_sequence A134429 A100667 A096438
Adjacent sequences: A151565 A151566 A151567 this_sequence A151569 A151570 A151571
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), May 25 2009
|
|
|
Search completed in 0.002 seconds
|
