|
|
A122756
|
|
Odd-indexed terms, a(n) = 2^n. Even-indexed terms, a(n) = floor(2^n+2^(n-1)).
|
|
5
|
|
|
1, 2, 6, 8, 24, 32, 96, 128, 384, 512, 1536, 2048, 6144, 8192, 24576, 32768, 98304, 131072, 393216, 524288, 1572864, 2097152, 6291456, 8388608, 25165824, 33554432, 100663296, 134217728, 402653184, 536870912, 1610612736, 2147483648
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
a(0)=1, a(1)=2, a(2)=6, a(n)=4*a(n-2) for n>=3. G.f.: (1+2*x+2*x^2)/(1-4*x^2). - Philippe Deléham, Dec 14 2007
a(n-1) = (5*2^n - (-2)^n)/8 for n>1. - Ralf Stephan, Jul 18 2013
|
|
EXAMPLE
|
Binary.................Decimal
1............................1
10...........................2
110..........................6
1000.........................8
11000.......................24
100000......................32
1100000.....................96
10000000...................128
110000000..................384
1000000000.................512
11000000000...............1536
100000000000..............2048
1100000000000.............6144
|
|
MATHEMATICA
|
a[n_] := If[Mod[n, 2] == 0, 2^(n + 1), 2^n + 2^(n + 1)] Table[a[n], {n, 0, 30}]
Join[{1, 2}, LinearRecurrence[{0, 4}, {6, 8}, 40]] (* Vincenzo Librandi, Feb 10 2018 *)
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|