Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A080144
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A080144 a(n)=F(4)F(n)F(n+1)+F(5)F(n+1)^2 if n odd, a(n)=F(4)F(n)F(n+1)+F(5)F(n+1)^2-F(5) if n even, F(n)=Fibonacci number A000045. +0
1
0, 8, 21, 63, 165, 440, 1152, 3024, 7917, 20735, 54285, 142128, 372096, 974168, 2550405, 6677055, 17480757, 45765224, 119814912, 313679520, 821223645, 2149991423, 5628750621, 14736260448, 38580030720, 101003831720 (list; graph; listen)
OFFSET

0,2

FORMULA

G.f.: (8x+5x^2-3x^3)/((1-x^2)(1-2x-2x^2+x^3))

a(n)=sum(i=0, n, A000045(i+5)*A000045(i)) - Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 14 2004

MATHEMATICA

CoefficientList[Series[(8x+5x^2-3x^3)/((1-x^2)(1-2x-2x^2+x^3)), {x, 0, 30}], x]

CROSSREFS

Cf. A064831 A059840 A080143.

Sequence in context: A075629 A067334 A066859 this_sequence A096018 A054855 A100903

Adjacent sequences: A080141 A080142 A080143 this_sequence A080145 A080146 A080147

KEYWORD

easy,nonn

AUTHOR

Mario Catalani (mario.catalani(AT)unito.it), Jan 31 2003

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 July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research