|
Search: id:A063481
|
|
| |
|
| 2, 12, 80, 576, 4352, 33792, 266240, 2113536, 16842752, 134479872, 1074790400, 8594128896, 68736253952, 549822922752, 4398314946560, 35185445830656, 281479271677952, 2251816993554432, 18014467228958720, 144115462953762816
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
Shift 2^n+1 left 2n bits.
|
|
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}]
|
|
PROGRAM
|
(PARI) for(n=0, 22, print(shift(2^n+1, 2*n)))
|
|
CROSSREFS
|
Cf. A000051, A034472, A052539, A034474, A062394, A034491, A062395, A062396, A007689, A063376, A074600 - A074624.
Sequence in context: A107632 A082142 A069723 this_sequence A052822 A058872 A055548
Adjacent sequences: A063478 A063479 A063480 this_sequence A063482 A063483 A063484
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Jason Earls (zevi_35711(AT)yahoo.com), Jul 28 2001
|
|
EXTENSIONS
|
Edited by Robert G. Wilson v (rgwv(AT)rgwv.com), Aug 25 2002
|
|
|
Search completed in 0.002 seconds
|
