login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A005166
a(0) = 1; a(n) = (1 + a(0)^3 + ... + a(n-1)^3)/n (not always integral!).
(Formerly M1551)
6
1, 2, 5, 45, 22815, 2375152056927, 2233176271342403475345148513527359103
OFFSET
0,2
COMMENTS
Terms are integers until n=A097398(2,2)=89.
Guy states that by computing the sequence modulo 89 it is easy to show that a(89) is not integral. - T. D. Noe, Sep 17 2007
REFERENCES
R. K. Guy, Unsolved Problems in Number Theory, Springer, 1st edition, 1981. See section E15.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
R. K. Guy, Letter to N. J. A. Sloane, Sep 25 1986.
R. K. Guy, The strong law of small numbers. Amer. Math. Monthly 95 (1988), no. 8, 697-712.
R. K. Guy, The strong law of small numbers. Amer. Math. Monthly 95 (1988), no. 8, 697-712. [Annotated scanned copy]
Alex Stone, The Astonishing Behavior of Recursive Sequences, Quanta Magazine, Nov 16 2023, 13 pages.
Eric Weisstein's World of Mathematics, Goebel's Sequence.
MATHEMATICA
a[0]=1; a[n_]:=(1 + Sum[a[k]^3, {k, 0, n-1}])/n; Array[a, 7, 0] (* Stefano Spezia, Oct 13 2024 *)
CROSSREFS
Cf. A108394.
Sequence in context: A334252 A307147 A056680 * A121621 A225147 A119715
KEYWORD
nonn,easy,nice
STATUS
approved