|
Search: id:A088697
|
|
|
| A088697 |
|
Replace 0 with 10 in binary representation of n. |
|
+0
3
|
|
| 0, 1, 6, 3, 26, 13, 14, 7, 106, 53, 54, 27, 58, 29, 30, 15, 426, 213, 214, 107, 218, 109, 110, 55, 234, 117, 118, 59, 122, 61, 62, 31, 1706, 853, 854, 427, 858, 429, 430, 215, 874, 437, 438, 219, 442, 221, 222, 111, 938, 469, 470, 235, 474, 237
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
FORMULA
|
a(0)=0, a(2n) = 4a(n) + 2, a(2n+1) = 2a(n) + 1.
|
|
EXAMPLE
|
n=9: 1001 -> 110101 = 53, so a(9) = 53.
|
|
PROGRAM
|
(PARI) a(n)=if(n<1, 0, if(n%2==0, 4*a(n/2)+2, 2*a((n-1)/2)+1))
|
|
CROSSREFS
|
Cf. A084471, A048678, A088698.
Sequence in context: A019069 A134410 A123153 this_sequence A039631 A066561 A073872
Adjacent sequences: A088694 A088695 A088696 this_sequence A088698 A088699 A088700
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Ralf Stephan (ralf(AT)ark.in-berlin.de), Oct 07 2003
|
|
|
Search completed in 0.002 seconds
|
