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.

A065679 If n is even, a(n) = n^2 else a(n) = n.

Original entry on oeis.org

0, 1, 4, 3, 16, 5, 36, 7, 64, 9, 100, 11, 144, 13, 196, 15, 256, 17, 324, 19, 400, 21, 484, 23, 576, 25, 676, 27, 784, 29, 900, 31, 1024, 33, 1156, 35, 1296, 37, 1444, 39, 1600, 41, 1764, 43, 1936, 45, 2116, 47, 2304, 49, 2500, 51, 2704, 53, 2916, 55, 3136, 57
Offset: 0

Views

Author

Robert G. Wilson v, Dec 03 2001

Keywords

Crossrefs

Cf. A000217, A065599, A016742 (bisection), A005408 (bisection).
Cf. A225144.

Programs

  • Magma
    /* By the third formula: */ A000217:=func; [A000217(n)+(-1)^n*A000217(n-1): n in [0..60]]; // Bruno Berselli, Jun 06 2013
  • Mathematica
    Table[ n^ (Mod[n + 1, 2] + 1), {n, 0, 60} ]
  • PARI
    a(n) = { if (n%2, n, n^2) } \\ Harry J. Smith, Oct 26 2009
    

Formula

a(n) = n^( (n+1) (mod 2) + 1 ).
O.g.f.: x*(1+x^2)*(1+4*x-x^2)/(1-x^2)^3. - Len Smiley, Dec 05 2001
a(n) = A000217(n)+(-1)^n*A000217(n-1) with A000217(-1)=0. - Bruno Berselli, Jun 06 2013