A220360 a(n) = Fibonacci(n-1) * Fibonacci(n+1) * Fibonacci(n+2).
0, 6, 15, 80, 312, 1365, 5712, 24310, 102795, 435744, 1845360, 7817849, 33115680, 140282310, 594242103, 2517255280, 10663255848, 45170290605, 191344398960, 810547917686, 3433536019155, 14544692076096, 61612304191200, 260993909055025, 1105587940064832
Offset: 1
Keywords
References
- R. K. Guy, Unsolved Problems in Number Theory, D20.
Links
- Harvey P. Dale, Table of n, a(n) for n = 1..1000
- J. H. Jordan, B. E. Peterson, Almost regular integer Fibonacci pentagons, Rocky Mountain J. Math. Volume 23, Number 1 (1993), 243-247.
Crossrefs
Cf. A000045.
Programs
-
Mathematica
Table[Fibonacci[n - 1]*Fibonacci[n + 1]*Fibonacci[n + 2], {n, 30}] (* T. D. Noe, Dec 13 2012 *) #[[1]]#[[3]]#[[4]]&/@Partition[Fibonacci[Range[0,30]],4,1] (* Harvey P. Dale, Apr 08 2022 *)
-
PARI
a(n) = fibonacci(n-1) * fibonacci(n+1) * fibonacci(n+2); \\ Michel Marcus, Mar 26 2016
-
PARI
x='x+O('x^99); concat(0, Vec((6*x-3*x^2-x^3)/(1-3*x-6*x^2+3*x^3+x^4))) \\ Altug Alkan, Mar 26 2016
Formula
G.f.: (6*x - 3*x^2 - x^3)/(1 - 3*x - 6*x^2 + 3*x^3 + x^4); a(n) = 3*a(n-1) + 6*a(n-2) - 3*a(n-3) - a(n-4). [Ron Knott, Jun 27 2013]
Sum {n >= 2} 1/a(n) = 1/4. - Peter Bala, Nov 30 2013
a(n) = 4*(-1)^n*F(n-1)/5 + (-1)^n*F(n) + F(3*n+2)/5 with F=A000045. - Ehren Metcalfe, Mar 26 2016
Comments