cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

0, 2, 32, 1536, 262144, 167772160, 412316860416, 3940649673949184, 147573952589676412928, 21760664753063325144711168, 12676506002282294014967032053760, 29243015907268149203883755326167580672, 267608942382367477698428619271780338071764992, 9727754898074489823563726246559579778829887006048256
Offset: 0

Views

Author

Indranil Ghosh, Jan 06 2017

Keywords

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.

Crossrefs

Programs

  • Mathematica
    Table[n*2^n^2,{n,0,20}] (* Harvey P. Dale, Jan 01 2021 *)
  • Python
    a=lambda n: n<<(n**2)

Formula

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