login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A122909 F(n+1)F(2n+2)+F(n)F(2n). 0
1, 4, 19, 79, 338, 1427, 6053, 25628, 108583, 459931, 1948354, 8253271, 34961561, 148099316, 627359147, 2657535383, 11257501522, 47687540107, 202007664157, 855718193164, 3624880442591, 15355239954179, 65045840274434 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

Let M be the matrix M(n,k)=F(k+1)*sum{j=0..n, (-1)^(n-j)C(n,j)C(j+1,k+1)}. a(n) gives the row sums of M^3.

LINKS

Table of n, a(n) for n=0..22.

Index entries for linear recurrences with constant coefficients, signature (3,6,-3,-1).

FORMULA

G.f.: (1+x)*(1+x^2) / ( (x^2+4*x-1)*(x^2-x-1) ).

a(n)=(sqrt(5)+2)^n(sqrt(5)/5+3/5)-2^(-n-1)(sqrt(5)-1)^n(sqrt(5)/5+1/5)+ 2^(-n-1)(sqrt(5)+1)^n(sqrt(5)/5-1/5)(-1)^n+(sqrt(5)-2)^n(3/5-sqrt(5)/5)(-1)^n;

a(n) = (2*A163063(n) -A061084(n))/5. - R. J. Mathar, Jun 08 2016

MATHEMATICA

Table[Fibonacci[n+1]Fibonacci[2n+2]+Fibonacci[n]Fibonacci[2n], {n, 0, 30}] (* or *) LinearRecurrence[{3, 6, -3, -1}, {1, 4, 19, 79}, 30] (* Harvey P. Dale, Dec 11 2016 *)

CROSSREFS

Cf. A000045, A037451.

Sequence in context: A037681 A156760 A320088 * A215037 A181300 A027240

Adjacent sequences:  A122906 A122907 A122908 * A122910 A122911 A122912

KEYWORD

easy,nonn

AUTHOR

Paul Barry, Sep 18 2006

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 21 23:34 EDT 2021. Contains 348160 sequences. (Running on oeis4.)