Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A074678
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A074678 a(n)=Sum((-1)^(i+Floor(n/2))S(2i+e),(i=0,..,Floor(n/2))), where S(n) are generalized tribonacci numbers (A001644) and e=(1/2)(1-(-1)^n). +0
3
3, 1, 0, 6, 11, 15, 28, 56, 103, 185, 340, 630, 1159, 2127, 3912, 7200, 13243, 24353, 44792, 82390, 151539, 278719, 512644, 942904, 1734271, 3189817, 5866988, 10791078, 19847887, 36505951, 67144912, 123498752, 227149619, 417793281 (list; graph; listen)
OFFSET

0,1

COMMENT

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

FORMULA

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

MATHEMATICA

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

CROSSREFS

Cf. A001644, A056594.

Sequence in context: A137651 A058152 A058140 this_sequence A130888 A010601 A110504

Adjacent sequences: A074675 A074676 A074677 this_sequence A074679 A074680 A074681

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 December 2 11:54 EST 2009. Contains 167921 sequences.


AT&T Labs Research