|
|
A062971
|
|
a(n) = (2*n)^n.
|
|
20
|
|
|
1, 2, 16, 216, 4096, 100000, 2985984, 105413504, 4294967296, 198359290368, 10240000000000, 584318301411328, 36520347436056576, 2481152873203736576, 182059119829942534144, 14348907000000000000000, 1208925819614629174706176, 108428035605965932354207744
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
Shift n^n left n bits.
Also the number of input-closed output-Boolean Moore machines on n states. - David Spivak, Feb 14 2020
|
|
LINKS
|
|
|
FORMULA
|
E.g.f.: -(2*x*e^(-W(-2*x)))/(W(-2*x)*(W(-2*x)+1)), W(x) is Lambert's function. - Vladimir Kruchinin, May 09 2013
|
|
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
|
|
|
MATHEMATICA
|
Join[{1}, Table[(2*n)^n, {n, 1, 50}]] (* G. C. Greubel, Nov 10 2017 *)
|
|
PROG
|
(PARI) for(n=0, 20, print1(shift(n^n, n), ", "))
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|