|
Search: id:A151706
|
|
|
| A151706 |
|
a(0)=1, a(1)=0; a(2^i+j)=2*a(j)+2*a(j+1) for 0 <= j < 2^i. |
|
+0
16
|
|
| 1, 0, 2, 4, 2, 4, 12, 12, 2, 4, 12, 12, 12, 32, 48, 28, 2, 4, 12, 12, 12, 32, 48, 28, 12, 32, 48, 48, 88, 160, 152, 60, 2, 4, 12, 12, 12, 32, 48, 28, 12, 32, 48, 48, 88, 160, 152, 60, 12, 32, 48, 48, 88, 160, 152, 80, 88, 160, 192, 272, 496, 624, 424, 124, 2, 4, 12, 12, 12, 32, 48
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
MAPLE
|
See A151702 for Maple code.
|
|
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.
Sequence in context: A166242 A051638 A155682 this_sequence A055372 A136620 A139548
Adjacent sequences: A151703 A151704 A151705 this_sequence A151707 A151708 A151709
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Jun 06 2009
|
|
|
Search completed in 0.002 seconds
|
