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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A115008 a(n) = a(n-1)+a(n-3)+a(n-4). 3
1, 0, 2, 4, 5, 7, 13, 22, 34, 54, 89, 145, 233, 376, 610, 988, 1597, 2583, 4181, 6766, 10946, 17710, 28657, 46369, 75025, 121392, 196418, 317812, 514229, 832039, 1346269, 2178310, 3524578, 5702886, 9227465, 14930353, 24157817, 39088168 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

a(2n) = F(2n+1) = A001519(n). a(n+2) - a(n+1) - a(n) gives match to A000034, apart from signs.

FORMULA

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

a(2n+1) = (-1)^(n+1) + A001906(n+1) (compare with a similar property for A116697) - Creighton Dement (creighton.k.dement(AT)uni-oldenburg.de), Mar 31 2006

CROSSREFS

Cf. A006498, A116697, A116698, A116699.

Sequence in context: A050027 A123643 A168540 * A115883 A063508 A101724

Adjacent sequences:  A115005 A115006 A115007 * A115009 A115010 A115011

KEYWORD

easy,nonn

AUTHOR

Creighton Dement (creighton.k.dement(AT)uni-oldenburg.de), Feb 23 2006

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 14 17:53 EST 2012. Contains 205651 sequences.