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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A049601 a(n)=Sum{T(2i,n-2i): i=0,1,...,[ n/2 ]}, array T as in A049600. 1
0, 0, 2, 3, 12, 25, 76, 182, 504, 1275, 3410, 8811, 23256, 60580, 159094, 415715, 1089648, 2850645, 7466468, 19541994, 51170460, 133951675, 350713222, 918141623, 2403786672, 6293097000, 16475700746, 43133687427, 112925875764 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Table of n, a(n) for n=0..28.

Index entries for linear recurrences with constant coefficients, signature (2,3,-4,1).

FORMULA

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

a(n) = (Fibonacci(2*n)+(-1)^n*Fibonacci(n))/2. - Vladeta Jovovic, Aug 30 2004

CROSSREFS

Cf. A049602.

Sequence in context: A293697 A084728 A099429 * A148060 A148061 A148062

Adjacent sequences:  A049598 A049599 A049600 * A049602 A049603 A049604

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 16 21:22 EST 2019. Contains 320199 sequences. (Running on oeis4.)