Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A116415
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A116415 a(n)=5a(n-1)-3a(n-2). +0
3
1, 5, 22, 95, 409, 1760, 7573, 32585, 140206, 603275, 2595757, 11168960, 48057529, 206780765, 889731238, 3828313895, 16472375761, 70876937120, 304967558317, 1312206980225, 5646132226174, 24294040190195, 104531804272453 (list; graph; listen)
OFFSET

0,2

COMMENT

Row sums of A116414.

Binomial transform of the sequence A006190 - Sergio Falcon (sfalcon(AT)dma.ulpgc.es), Nov 23 2007

REFERENCES

Sergio Falcon and Angel Plaza: "On k-Fibonacci sequences and polynomials and their derivatives". doi:10.1016/j.chaos.2007.03.2007

FORMULA

G.f.: 1/(1-5x+3x^2) a(n)=sum{k=0..n, sum{j=0..n, C(n-j,k)C(k+j,j)3^j}}.

a(n)=(1/sqrt(13))*(((5+sqrt(13))/2)^n-((5-sqrt(13))/2)^n) - Sergio Falcon (sfalcon(AT)dma.ulpgc.es), Nov 23 2007

CROSSREFS

Cf. A001906, A007070, A084326.

Sequence in context: A053154 A141222 A127360 this_sequence A026861 A026888 A083586

Adjacent sequences: A116412 A116413 A116414 this_sequence A116416 A116417 A116418

KEYWORD

easy,nonn

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Feb 13 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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research