|
| |
|
|
A070233
|
|
Let u(k) v(k) w(k) be the recursions u(1)=v(1)=w(1)=1 u(k+1)=u(k)+v(k)+w(k) v(k+1)=u(k)v(k)+v(k)w(k)+w(k)u(k) w(k+1)=u(k)v(k)w(k); then a(n)=w(n).
|
|
0
| |
|
|
1, 1, 9, 945, 8876385, 3689952451492545, 98367948795841301790914258556831105, 3882894052327309905582682317031276840071039865528864289025562807872336355445505
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,3
|
|
|
COMMENTS
| Next term is too large to include.
|
|
|
FORMULA
| Let C be the positive root of x^3+x^2-2x-1=0 (C = 1, 246979603717...); then lim n -> infinity u(n)^(C+1)/w(n)= lim n -> infinity u(n)^C/v(n) = lim n -> infinity v(n)^B/w(n)=1 with B=C+1-1/(1+C)=1, 801...
|
|
|
CROSSREFS
| Cf. A003686, A064847.
Sequence in context: A015107 A024124 A036255 * A087590 A048561 A112909
Adjacent sequences: A070230 A070231 A070232 * A070234 A070235 A070236
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Benoit Cloitre (benoit7848c(AT)orange.fr), May 08 2002
|
| |
|
|
