login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A056015
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), with a(0)=...=a(4)=0, a(5)=1.
4
0, 0, 0, 0, 0, 1, 6, 31, 152, 730, 3480, 16542, 78544, 372779, 1768958, 8393741, 39827472, 188975588, 896658432, 4254492236, 20186832928, 95783024581, 454473817254, 2156399264651, 10231739547432, 48547824776670, 230350985294584, 1092975362559562
OFFSET
0,7
COMMENTS
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+1) (tribonacci numbers).
FORMULA
O.g.f.: -x^5/((x^3+x^2-5*x+1)*(x^3+x^2+x-1)). - R. J. Mathar, Nov 23 2007
CROSSREFS
Sequence in context: A268401 A346226 A240879 * A128740 A227505 A026705
KEYWORD
nonn,easy
AUTHOR
Asher Auel, Jun 06 2000
EXTENSIONS
New name, from formula, added by Michel Marcus, Mar 19 2024
STATUS
approved