A068096 a(n) = F(L(n)) where F(n) = n-th Fibonacci number and L(n) = n-th Lucas number.

1, 1, 2, 3, 13, 89, 2584, 514229, 2971215073, 3416454622906707, 22698374052006863956975682, 173402521172797813159685037284371942044301, 8801063578447437644962364569698707634360652047981718378070013667111

Offset

0,3

Links

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

Formula

a(n) = Sum_{k=1..F(n-1)+1} binomial(F(n-1), k-1)*F(F(n)+k-1), where F(n) is A000045. - Tony Foster III, Sep 03 2018

Mathematica

Table[Fibonacci[LucasL[n]], {n, 0, 13}] (* Vladimir Joseph Stephan Orlovsky, Feb 08 2012 *)

Prog

(Magma) [Fibonacci(Lucas(n)): n in [0..12]]; // Vincenzo Librandi, Sep 18 2017
(PARI) a(n) = fibonacci(fibonacci(n+1)+fibonacci(n-1)) \\ Felix Fröhlich, Sep 17 2017

Crossrefs

Cf. A000032, A000045, A005371.

Sequence in context: A013167 A224239 A361520 * A098462 A125283 A098406

Adjacent sequences: A068093 A068094 A068095 * A068097 A068098 A068099

Keyword

easy,nonn

Author

Leroy Quet, Mar 22 2002

Status

approved