login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A062971 a(n) = (2*n)^n. 9
1, 2, 16, 216, 4096, 100000, 2985984, 105413504, 4294967296, 198359290368, 10240000000000, 584318301411328, 36520347436056576, 2481152873203736576, 182059119829942534144, 14348907000000000000000 (list; graph; refs; listen; history; text; 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

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]

E.g.f.: 1/(1 + LambertW(-2*x)). - Vaclav Kotesovec, Dec 21 2014

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

a:=n->mul(2*sum(1, j=0..n), k=0..n): seq(a(n), n=-1..14); # Zerinvary Lajos, 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)) ) } \\ Harry J. Smith, Aug 14 2009

CROSSREFS

Column k=1 of A246070.

Sequence in context: A206865 A114531 A012056 * A267782 A012164 A264543

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, Mar 08 2003

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified July 25 10:40 EDT 2017. Contains 289792 sequences.