This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A054783 (n^2)-th Fibonacci number. 10
 0, 1, 3, 34, 987, 75025, 14930352, 7778742049, 10610209857723, 37889062373143906, 354224848179261915075, 8670007398507948658051921, 555565404224292694404015791808, 93202207781383214849429075266681969, 40934782466626840596168752972961528246147 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Seiichi Manyama, Table of n, a(n) for n = 0..69 T. Kotek, J. A. Makowsky, Recurrence Relations for Graph Polynomials on Bi-iterative Families of Graphs, arXiv preprint arXiv:1309.4020 [math.CO], 2013. FORMULA a(n) = Sum_{k=1..T(n-1)+1} binomial(T(n-1), k-1)*F(n-1+k), where F(n) is A000045 and T(n) is A000217. - Tony Foster III, Sep 03 2018 MAPLE a:= n-> (<<0|1>, <1|1>>^(n^2))[1, 2]: seq(a(n), n=0..15);  # Alois P. Heinz, Jun 10 2018 MATHEMATICA Table[Fibonacci[n^2], {n, 15}] (* Vladimir Joseph Stephan Orlovsky, Feb 08 2012 *) PROG (MAGMA) [Fibonacci(n^2): n in [0..50]]; // Vincenzo Librandi, Apr 09 2011 (PARI) a(n)=fibonacci(n^2) \\ Charles R Greathouse IV, Oct 07 2016 CROSSREFS Cf. (n^k)-th Fibonacci number: A000045 (k=1), this sequence (k=2), A182149 (k=3), A250490 (k=4), A250491 (k=5), A250492 (k=6), A250493 (k=7), A250494 (k=8). Cf. A081667. Sequence in context: A222778 A101633 A250093 * A222892 A102104 A194890 Adjacent sequences:  A054780 A054781 A054782 * A054784 A054785 A054786 KEYWORD nonn AUTHOR Jeff Burch, May 22 2000 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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 19 19:55 EDT 2018. Contains 316378 sequences. (Running on oeis4.)