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.

A276979 a(n) = (floor(n/2)+1)^n.

Original entry on oeis.org

1, 4, 8, 81, 243, 4096, 16384, 390625, 1953125, 60466176, 362797056, 13841287201, 96889010407, 4398046511104, 35184372088832, 1853020188851841, 16677181699666569, 1000000000000000000, 10000000000000000000, 672749994932560009201
Offset: 1

Views

Author

Olivier Gérard, Sep 23 2016

Keywords

Comments

Functions from [n] to [n] with f(i) even or f(i) = 1 for all i.
Functions from [n] to [n] with f(i) odd or f(i) = n for all i.

Crossrefs

Programs

  • Mathematica
    Table[(Floor[n/2] + 1)^n, {n, 1, 20}]
  • PARI
    a(n) = (n\2 + 1)^n; \\ Michel Marcus, Oct 08 2016