login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A238243 A recursive sequence: a(n) = Fibonacci(n)*a(n-1) + 2. 3
1, 3, 8, 26, 132, 1058, 13756, 288878, 9821854, 540201972, 48077975510, 6923228473442, 1613112234311988, 608143312335619478, 370967420524727881582, 366144844057906419121436, 584733315960476551336933294, 1510950888441871408654635631698 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..18.

FORMULA

a(n) ~ c * ((1+sqrt(5))/2)^(n^2/2+n/2) / 5^(n/2), where c = A062073 * (2*A101689-1) = 5.4087126382942177293... is product of Fibonacci factorial constant (see A062073) and -1+2*sum_{n>=1} 1/product(A000045(k), k=1..n).

MATHEMATICA

RecurrenceTable[{a[n]==Fibonacci[n]*a[n-1]+2, a[1]==1}, a, {n, 1, 20}]

CROSSREFS

Cf. A176343, A238244, A003266, A101689, A062073, A000045, A139339.

Sequence in context: A006870 A058802 A054097 * A298624 A088590 A023637

Adjacent sequences:  A238240 A238241 A238242 * A238244 A238245 A238246

KEYWORD

nonn

AUTHOR

Vaclav Kotesovec, Feb 20 2014

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 15 19:43 EDT 2021. Contains 342977 sequences. (Running on oeis4.)