login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A176343 a(n) = Fibonacci(n)*a(n - 1) + 1, a(0) = 0. 5
0, 1, 2, 5, 16, 81, 649, 8438, 177199, 6024767, 331362186, 29491234555, 4246737775921, 989489901789594, 373037692974676939, 227552992714552932791, 224594803809263744664718, 358677901683394200229554647 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 0..100

FORMULA

a(n) = Fibonacci(n)*a(n - 1) + 1, a(0) = 0.

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

MATHEMATICA

a[0] = 0; a[n_] := a[n] = Fibonacci[n]*a[n - 1] + 1; Table[a[n], {n, 0, 20}]

CROSSREFS

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

Sequence in context: A236960 A290609 A048754 * A327062 A306020 A037075

Adjacent sequences:  A176340 A176341 A176342 * A176344 A176345 A176346

KEYWORD

nonn,easy

AUTHOR

Roger L. Bagula, Apr 15 2010

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 November 13 23:48 EST 2019. Contains 329106 sequences. (Running on oeis4.)