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.

A065067 First differences of A065027.

Original entry on oeis.org

1, 2, 3, 2, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 3, 2, 3, 3, 2, 3, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 3, 2, 3, 3, 2, 3, 3, 3, 2, 3, 3, 2, 3, 3, 3, 2, 3, 3, 2, 3, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 3, 2, 3, 3, 2, 3, 3, 3, 2, 3, 3, 2, 3, 3, 3, 2, 3, 3, 2, 3, 3, 3, 2, 3, 3, 2, 3, 3
Offset: 0

Views

Author

Floor van Lamoen, Nov 07 2001

Keywords

Crossrefs

Cf. A065027.

Programs

  • Mathematica
    f[1] = 2; f[n_] := f[n] = Block[{k = f[n - 1]}, While[k! <= n^k, k++ ]; k]; t = Table[ f[n], {n, 1, 110}]; Drop[t, 1] - Drop[t, -1]
    sm0[n_]:=Module[{m=1},While[n^m>=m!,m++];m]; Differences[Array[sm0,120]] (* Harvey P. Dale, Jan 24 2018 *)
  • PARI
    { m=1; p=2; for (n=1, 1000, until ((n + 1)^m < m!, m++); a=m - p; p=m; write("b065067.txt", n, " ", a) ) } \\ Harry J. Smith, Oct 05 2009

Formula

a(n) = A065027(n+1) - A065027(n).

Extensions

More terms from Robert G. Wilson v, Jul 12 2003
a(0)=1 prepended by Alois P. Heinz, Dec 21 2019