The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A068096 a(n) = F(L(n)) where F(n) = n-th Fibonacci number and L(n) = n-th Lucas number. 3
 1, 1, 2, 3, 13, 89, 2584, 514229, 2971215073, 3416454622906707, 22698374052006863956975682, 173402521172797813159685037284371942044301, 8801063578447437644962364569698707634360652047981718378070013667111 (list; graph; refs; listen; history; text; internal format)
 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

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

Last modified September 21 15:36 EDT 2023. Contains 365502 sequences. (Running on oeis4.)