login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A065067 First differences of A065027. 2
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
a(n) = A065027(n+1) - A065027(n).
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 *)
PROG
(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
CROSSREFS
Cf. A065027.
Sequence in context: A074070 A304097 A251101 * A086411 A105528 A076225
KEYWORD
nonn
AUTHOR
Floor van Lamoen, Nov 07 2001
EXTENSIONS
More terms from Robert G. Wilson v, Jul 12 2003
a(0)=1 prepended by Alois P. Heinz, Dec 21 2019
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 05:16 EDT 2024. Contains 371906 sequences. (Running on oeis4.)