|
|
A003482
|
|
a(n) = 7*a(n-1) - a(n-2) + 4, with a(0) = 0, a(1) = 5.
(Formerly M3988)
|
|
10
|
|
|
0, 5, 39, 272, 1869, 12815, 87840, 602069, 4126647, 28284464, 193864605, 1328767775, 9107509824, 62423800997, 427859097159, 2932589879120, 20100270056685, 137769300517679, 944284833567072, 6472224534451829, 44361286907595735, 304056783818718320
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
The values (a(n),x(n)), n >= 2, x(n)=Fibonacci(2*n+2)*Fibonacci(2*n+3)=A081018(n+1), are the integer solutions (a,x) of the equation binomial(x+1,a+1) + binomial(x+2,a+1) = binomial(x+3,a+1). - Klaus Strassburger (strass(AT)ddfi.uni-duesseldorf.de)
The values (a(n),x(n)), n >= 2 are also the integer solutions (a, x) of the equation x(a+1) = (x-a)(x-a-1) or, equivalently, binomial(x, a) = binomial(x-1, a+1). - Tomohiro Yamada, May 30 2018
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
Heiko Harborth, Fermat-like binomial equations, Applications of Fibonacci numbers, Proc. 2nd Int. Conf., San Jose, California, August 1986, 1-5 (1988).
|
|
FORMULA
|
a(n) = Fibonacci(2*n) * Fibonacci(2*n+3).
a(n) = Fibonacci(2*n+2)^2 - Fibonacci(2*n+1)^2. - Gary Detlefs, Oct 12 2011
a(n) = -4/5 + (sqrt(5)/5 + 2/5)*(7/2 + 3*sqrt(5)/2)^n - (sqrt(5)/5 - 2/5)*(7/2 - 3*sqrt(5)/2)^n. - Antonio Alberto Olivares, May 29 2013
a(n) = Sum_{k=2..2*n+1} Fibonacci(k)^2.
|
|
EXAMPLE
|
G.f. = 5*x + 39*x^2 + 272*x^3 + 1869*x^4 + 12815*x^5 + 87840*x^6 + ... - Michael Somos, Jun 26 2018
|
|
MAPLE
|
|
|
MATHEMATICA
|
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|