|
|
A063481
|
|
a(n) = 4^n + 8^n.
|
|
40
|
|
|
2, 12, 80, 576, 4352, 33792, 266240, 2113536, 16842752, 134479872, 1074790400, 8594128896, 68736253952, 549822922752, 4398314946560, 35185445830656, 281479271677952, 2251816993554432, 18014467228958720, 144115462953762816
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
Shift 2^n+1 left 2n bits.
|
|
LINKS
|
|
|
FORMULA
|
G.f.: G(0), where G(k)= 1 + 2^k/(1 - 4*x/(4*x + 2^k/G(k+1) )); (continued fraction). - Sergei N. Gladkovskii, Jul 22 2013
|
|
EXAMPLE
|
n=3: 23+1 shifted 2*3 bits to the left is 576 because 23+1 in binary is [1, 0, 0, 1] and 576 is [1, 0, 0, 1, 0, 0, 0, 0, 0, 0].
|
|
MATHEMATICA
|
Table[4^n + 8^n, {n, 0, 25}]
|
|
PROG
|
(PARI) for(n=0, 22, print(shift(2^n+1, 2*n)))
(PARI) { for (n=0, 200, write("b063481.txt", n, " ", shift(1, 2*n) + shift(1, 3*n)) ) } \\ Harry J. Smith, Aug 23 2009]
|
|
CROSSREFS
|
Cf. A000051, A034472, A052539, A034474, A062394, A034491, A062395, A062396, A007689, A063376, A074600 - A074624.
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|