Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A073728
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A073728 a(n)=Sum (S(k)), k=0,..,n, where S(n) are the tribonacci generalized numbers A001644. +0
1
3, 4, 7, 14, 25, 46, 85, 156, 287, 528, 971, 1786, 3285, 6042, 11113, 20440, 37595, 69148, 127183, 233926, 430257, 791366, 1455549, 2677172, 4924087, 9056808, 16658067, 30638962, 56353837, 103650866, 190643665, 350648368, 644942899 (list; graph; listen)
OFFSET

0,1

COMMENT

a(n)=3T(n+1)+T(n), where T(n) are the tribonacci numbers A000073

FORMULA

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

MATHEMATICA

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

CROSSREFS

Cf. A001644, A000073.

Sequence in context: A062203 A095063 A003242 this_sequence A132407 A070035 A024368

Adjacent sequences: A073725 A073726 A073727 this_sequence A073729 A073730 A073731

KEYWORD

easy,nonn

AUTHOR

Mario Catalani (mario.catalani(AT)unito.it), Aug 06 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 July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research