|
Search: id:A088698
|
|
|
| A088698 |
|
Replace 1 with 11 in binary representation of n. |
|
+0
3
|
|
| 0, 3, 6, 15, 12, 27, 30, 63, 24, 51, 54, 111, 60, 123, 126, 255, 48, 99, 102, 207, 108, 219, 222, 447, 120, 243, 246, 495, 252, 507, 510, 1023, 96, 195, 198, 399, 204, 411, 414, 831, 216, 435, 438, 879, 444, 891, 894, 1791, 240, 483
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
FORMULA
|
a(0)=0, a(2n) = 2a(n), a(2n+1) = 4a(n) + 3.
|
|
EXAMPLE
|
n=9: 1001 -> 110011 = 51, so a(9) = 51.
|
|
PROGRAM
|
(PARI) a(n)=if(n<1, 0, if(n%2==0, 2*a(n/2), 4*a((n-1)/2)+3))
|
|
CROSSREFS
|
Ordered terms plus one are in A048297.
Cf. A084471, A048678, A088697.
Sequence in context: A058141 A132279 A066107 this_sequence A105802 A066904 A059969
Adjacent sequences: A088695 A088696 A088697 this_sequence A088699 A088700 A088701
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Ralf Stephan (ralf(AT)ark.in-berlin.de), Oct 07 2003
|
|
|
Search completed in 0.002 seconds
|
