Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A080143
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A080143 a(n)=F(3)F(n)F(n+1)+F(4)F(n+1)^2-F(4) if n even, F(3)F(n)F(n+1)+F(4)F(n+1)^2 if n odd, F(n)= Fibonacci numbers A000045. +0
2
0, 5, 13, 39, 102, 272, 712, 1869, 4893, 12815, 33550, 87840, 229968, 602069, 1576237, 4126647, 10803702, 28284464, 74049688, 193864605, 507544125, 1328767775, 3478759198, 9107509824, 23843770272, 62423800997, 163427632717 (list; graph; listen)
OFFSET

0,2

FORMULA

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

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

MATHEMATICA

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

CROSSREFS

Cf. A064831 A059840 A080097.

Sequence in context: A071100 A125734 A129924 this_sequence A077919 A026069 A054856

Adjacent sequences: A080140 A080141 A080142 this_sequence A080144 A080145 A080146

KEYWORD

easy,nonn

AUTHOR

Mario Catalani (mario.catalani(AT)unito.it), Jan 30 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 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research