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”).

A074333
a(n+1) = a(n) + (a(n))^3 with a(0)=1.
1
1, 2, 10, 1010, 1030302010, 1093688489093570254240903010, 1308220420050293140207308568343275558610275754246390852904259630756188515781804010
OFFSET
0,2
COMMENTS
a(6) contains 82 digits. - Harvey P. Dale, Feb 19 2011 [corrected by Altug Alkan, Dec 22 2015]
For n > 2, the last three digits are always "010". - Altug Alkan, Dec 22 2015
a(7) has 244 digits, a(8) has 731. - Robert Israel, Dec 23 2015
LINKS
MAPLE
a[0]:= 1:
for n from 1 to 8 do a[n]:= a[n-1] + a[n-1]^3 od:
seq(a[i], i=0..8); # Robert Israel, Dec 23 2015
MATHEMATICA
NestList[#+#^3&, 1, 8] (* Harvey P. Dale, Feb 19 2011 *)
PROG
(PARI) a(n) = if(n==0, 1, a(n-1)+(a(n-1))^3); \\ Altug Alkan, Dec 22 2015
(Magma) [n le 1 select 1 else Self(n-1)+Self(n-1)^3: n in [1..10]]; // Vincenzo Librandi, Dec 23 2015
CROSSREFS
Sequence in context: A290495 A255587 A137890 * A008559 A245728 A171485
KEYWORD
nonn,easy
AUTHOR
Emrehan Halici (emrehan(AT)halici.com.tr), Sep 22 2002
EXTENSIONS
a(5) from Harvey P. Dale, Feb 19 2011
a(6) from Robert Israel, Dec 23 2015
STATUS
approved