|
Search: id:A070234
|
|
|
| A070234 |
|
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)=v(n). |
|
+0
1
|
|
| 1, 3, 15, 303, 325023, 2896797882687, 10689080432835089614170716799, 1051462916692114532403603811392745230616355871287492722818364671, 4082719105466537261158902273424141350756102191374943243599962042648477047915967800878229988886787905692389015371739271187273873490265611528703
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
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: A013353 A138896 A090627 this_sequence A036279 A029758 A103031
Adjacent sequences: A070231 A070232 A070233 this_sequence A070235 A070236 A070237
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), May 08 2002
|
|
|
Search completed in 0.002 seconds
|
