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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A280211 a(n) = n*(2^(n^2)). 1
0, 2, 32, 1536, 262144, 167772160, 412316860416, 3940649673949184, 147573952589676412928, 21760664753063325144711168, 12676506002282294014967032053760, 29243015907268149203883755326167580672, 267608942382367477698428619271780338071764992, 9727754898074489823563726246559579778829887006048256 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

a(n) =  n with the bits shifted to the left by n^2 places (new bits on the right hand side are zeros) i.e, a(n) = n<<(n**2).

a(n) is always even.

a(n) mod 32 = 0 for n>=2.

LINKS

Indranil Ghosh, Table of n, a(n) for n = 0..50

MSDN, Bitwise Left Shift Operator

Stack Overflow Use of Bit Shifting Operators

FORMULA

a(n) = n*(2^(n^2)).

a(n) = n*A002416(n). - Omar E. Pol, Jan 06 2017

PROG

(Python) a=lambda n: n<<(n**2)

CROSSREFS

Cf. A002416, A213541, A007745, A169810.

Sequence in context: A295418 A172286 A129348 * A087084 A193269 A088386

Adjacent sequences:  A280208 A280209 A280210 * A280212 A280213 A280214

KEYWORD

nonn,easy

AUTHOR

Indranil Ghosh, Jan 06 2017

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 23 03:08 EST 2019. Contains 319370 sequences. (Running on oeis4.)