|
Search: id:A003818
|
|
|
| A003818 |
|
a(1)=a(2)=1, a(n+1) = (a(n)^3 +1)/a(n-1). |
|
+0
1
|
|
| 1, 1, 2, 9, 365, 5403014, 432130991537958813, 14935169284101525874491673463268414536523593057
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
FORMULA
|
a(n) is asymptotic to c^F(2n) where F(n) is the n-th Fibonacci's number A000045(n) and c=1.1137378757136... - Benoit Cloitre (benoit7848c(AT)orange.fr), May 31 2005
|
|
MAPLE
|
A003818 := proc(n) option remember; if n <= 2 then 1 else (A003818(n-1)^3+1)/A003818(n-2); fi; end;
|
|
CROSSREFS
|
Adjacent sequences: A003815 A003816 A003817 this_sequence A003819 A003820 A003821
Sequence in context: A013093 A013169 A012991 this_sequence A049299 A024225 A000883
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Waldemar Pompe (pompe(AT)zodiac1.mimuw.edu.pl)
|
|
EXTENSIONS
|
More terms from Benoit Cloitre (benoit7848c(AT)orange.fr), May 31 2005
|
|
|
Search completed in 0.002 seconds
|
