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

 

Logo

The OEIS Foundation is grateful to everyone who made a donation during our Annual Appeal.     Visit the new and spectacular Pictures from the OEIS page!

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A049673 a(n)=(F(3n)+F(n))/3, where F=A000045 (the Fibonacci sequence). 0
0, 1, 3, 12, 49, 205, 864, 3653, 15463, 65484, 277365, 1174889, 4976832, 21082073, 89304891, 378301260, 1602509321, 6788337557, 28755857952, 121811766781, 516002920895, 2185823443596, 9259296684333, 39223010163217 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

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

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

FORMULA

G.f.: -x*(-1+2*x+x^2) / ( (x^2+4*x-1)*(x^2+x-1) ). - R. J. Mathar, Oct 26 2015

CROSSREFS

Sequence in context: A012772 A012864 A045890 * A052703 A151170 A151171

Adjacent sequences:  A049670 A049671 A049672 * A049674 A049675 A049676

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 | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified February 6 05:18 EST 2016. Contains 268029 sequences.