|
Search: id:A062971
|
|
| |
|
| 1, 2, 16, 216, 4096, 100000, 2985984, 105413504, 4294967296, 198359290368, 10240000000000, 584318301411328, 36520347436056576, 2481152873203736576, 182059119829942534144, 14348907000000000000000
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Shift n^n left n bits.
|
|
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].
|
|
PROGRAM
|
(PARI) for(n=0, 20, print(shift(n^n, n)))
|
|
CROSSREFS
|
Sequence in context: A004121 A114531 A012056 this_sequence A012164 A047657 A009233
Adjacent sequences: A062968 A062969 A062970 this_sequence A062972 A062973 A062974
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Jason Earls (jcearls(AT)cableone.net), Jul 23 2001
|
|
EXTENSIONS
|
New description from Vladeta Jovovic (vladeta(AT)Eunet.yu), Mar 08 2003
|
|
|
Search completed in 0.002 seconds
|
