Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A122909
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A122909 F(n+1)F(2n+2)+F(n)F(2n). +0
1
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; listen)
OFFSET

0,2

COMMENT

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.

FORMULA

G.f.: (1+x+x^2+x^3)/(1-3x-6x^2+3x^3+x^4); 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;

CROSSREFS

Cf. A000045, A037451.

Adjacent sequences: A122906 A122907 A122908 this_sequence A122910 A122911 A122912

Sequence in context: A130132 A037590 A037681 this_sequence A027240 A050914 A017961

KEYWORD

easy,nonn

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Sep 18 2006

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 6 16:13 EDT 2008. Contains 144667 sequences.


AT&T Labs Research