Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A056015
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A056015 A recursive sequence. +0
5
1, 6, 31, 152, 730, 3480, 16542, 78544, 372779, 1768958, 8393741, 39827472, 188975588, 896658432, 4254492236, 20186832928, 95783024581, 454473817254, 2156399264651, 10231739547432, 48547824776670, 230350985294584 (list; graph; listen)
OFFSET

5,2

COMMENT

With a(0)=0, a(1)=1, a(2)=1, a(3)=2, a(4)=4, a(5)=7, this recurrence produces a(n)=A000073(n) (tribonacci numbers).

FORMULA

a(n)=6*a(n-1)-5*a(n-2)-4*a(n-3)-3*a(n-4)+2*a(n-5)+a(n-6), a(0)=...=a(4)=0, a(5)=1.

O.g.f.: -x^5/((x^3+x^2-5*x+1)*(x^3+x^2+x-1)). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Nov 23 2007

CROSSREFS

Cf. A000073, A056014.

Sequence in context: A012714 A094951 A099621 this_sequence A128740 A026705 A003463

Adjacent sequences: A056012 A056013 A056014 this_sequence A056016 A056017 A056018

KEYWORD

nonn

AUTHOR

Asher Auel (asher.auel(AT)reed.edu) Jun 06 2000.

page 1

Search completed in 0.004 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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research