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
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
MATHEMATICA
Table[n*2^n^2, {n, 0, 20}] (* Harvey P. Dale, Jan 01 2021 *)
PROG
(Python) a=lambda n: n<<(n**2)
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Indranil Ghosh, Jan 06 2017
STATUS
approved