|
| |
|
|
A062971
|
|
a(n) = (2*n)^n.
|
|
5
| |
|
|
1, 2, 16, 216, 4096, 100000, 2985984, 105413504, 4294967296, 198359290368, 10240000000000, 584318301411328, 36520347436056576, 2481152873203736576, 182059119829942534144, 14348907000000000000000
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
COMMENTS
| Shift n^n left n bits.
|
|
|
LINKS
| Harry J. Smith, Table of n, a(n) for n=0,...,100
|
|
|
EXAMPLE
| n=3: 3^3 shifted three bits to the left is 216 because 3^3 in binary is: [1, 1, 0, 1, 1] and 216 in binary is: [1, 1, 0, 1, 1, 0, 0, 0].
|
|
|
MAPLE
| restart:a:=n->mul(2*sum(1, j=0..n), k=0..n): seq(a(n), n=-1..14); # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jan 01 2009]
|
|
|
PROG
| (PARI) for(n=0, 20, print(shift(n^n, n)))
(PARI) { for (n=0, 100, write("b062971.txt", n, " ", shift(n^n, n)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Aug 14 2009]
|
|
|
CROSSREFS
| Sequence in context: A206865 A114531 A012056 * A012164 A188688 A188844
Adjacent sequences: A062968 A062969 A062970 * A062972 A062973 A062974
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Jason Earls (zevi_35711(AT)yahoo.com), Jul 23 2001
|
|
|
EXTENSIONS
| New description from Vladeta Jovovic (vladeta(AT)eunet.rs), Mar 08 2003
|
| |
|
|
