Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A074677
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A074677 a(n)=Sum((-1)^(i+Floor(n/2))F(2i+e),(i=0,..,Floor(n/2))), where F(n) = Fibonacci numbers and e=(1/2)(1-(-1)^n). +0
5
0, 1, 1, 1, 2, 4, 6, 9, 15, 25, 40, 64, 104, 169, 273, 441, 714, 1156, 1870, 3025, 4895, 7921, 12816, 20736, 33552, 54289, 87841, 142129, 229970, 372100, 602070, 974169, 1576239, 2550409, 4126648, 6677056, 10803704, 17480761, 28284465, 45765225 (list; graph; listen)
OFFSET

0,5

COMMENT

a(n) is the convolution of F(n) with the sequence (1,0,-1,0,1,0,-1,0,...), A056594.

FORMULA

a(n)=a(n-1)+a(n-3)+a(n-4), a(0)=0, a(1)=1, a(2)=1, a(3)=1. G.f.: x/(1 - x - x^3 - x^4).

MATHEMATICA

CoefficientList[Series[x/(1 - x - x^3 - x^4), {x, 0, 40}], x]

CROSSREFS

Cf. A056594. Essentially the same as A006498.

Adjacent sequences: A074674 A074675 A074676 this_sequence A074678 A074679 A074680

Sequence in context: A076922 A057602 A006498 this_sequence A101756 A096398 A110538

KEYWORD

easy,nonn

AUTHOR

Mario Catalani (mario.catalani(AT)unito.it), Aug 30 2002

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 May 16 01:24 EDT 2008. Contains 139630 sequences.


AT&T Labs Research