login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A080145 a(n)=sum(sum(F(i)F(i+1),i=1,m),m=1,n), F(n)=Fibonacci numbers A000045. 1
0, 1, 4, 13, 37, 101, 269, 710, 1865, 4890, 12810, 33546, 87834, 229963, 602062, 1576231, 4126639, 10803695, 28284455, 74049680, 193864595, 507544116, 1328767764, 3478759188, 9107509812, 23843770261, 62423800984, 163427632705 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

a(n)=F(n+1)F(n+2)-floor((n+2)/2). a(n) is the 2-fold convolution of F(n)F(n+1) A001654 with the sequence 1,1,1,....

FORMULA

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

MATHEMATICA

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

..and/or..q=s1=s2=0; lst={}; Do[f=Fibonacci[n]; s2+=s1+=f*q; AppendTo[lst, s2]; q=f, {n, 5!}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Jul 21 2009]

CROSSREFS

Sequence in context: A103082 A048474 A054761 * A097551 A095126 A077842

Adjacent sequences:  A080142 A080143 A080144 * A080146 A080147 A080148

KEYWORD

easy,nonn

AUTHOR

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 17:11 EST 2012. Contains 205938 sequences.