|
Search: id:A116521
|
|
| |
|
| 0, 0, 0, 1, 5, 17, 51, 148, 429, 1250, 3655, 10701, 31336, 91752, 268623, 786414, 2302262, 6739984, 19731685, 57765711, 169112717, 495088023, 1449400960, 4243211207, 12422263776, 36366946961, 106466490879, 311687250156
(list; graph; listen)
|
|
|
OFFSET
|
0,5
|
|
|
COMMENT
|
See also A115390, the binomial transform of tribonacci sequence A000073. Tetranacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) + a(n-4), with a(0) = a(1) = a(2) = 0, a(3) = 1.
|
|
FORMULA
|
a(n) = SUM[k=0..n] C(n,k)*A00078(k).
G.f.= x^3/(1-5x+8x^2-6x^3+x^4). - Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 09 2006
|
|
EXAMPLE
|
Table shows the tetranacci numbers multiplied into rows of Pascal's triangle.
1*0 = 0.
1*0 + 1*0 = 0.
1*0 + 2*0 + 1*0 = 0.
1*0 + 3*0 + 3*0 + 1* 1 = 1.
1*0 + 4*0 + 6*0 + 4*1 + 1*1 = 5.
1*0 + 5*0 + 10*0 + 10*1 + 5*1 + 1*2 = 17.
|
|
MAPLE
|
t[0]:=0: t[1]:=0: t[2]:=0: t[3]:=1: for n from 4 to 35 do t[n]:=t[n-1]+t[n-2]+t[n-3]+t[n-4] od: seq(add(binomial(n, k)*t[k], k=0..n), n=0..30); # end of first Maple program G:=x^3/(1-5*x+8*x^2-6*x^3+x^4): Gser:=series(G, x=0, 33): seq(coeff(Gser, x, n), n=0..30); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 09 2006
|
|
CROSSREFS
|
Cf. A000078, A115390.
Adjacent sequences: A116518 A116519 A116520 this_sequence A116522 A116523 A116524
Sequence in context: A086866 A054452 A039783 this_sequence A137500 A034335 A037544
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Jonathan Vos Post (jvospost2(AT)yahoo.com), Mar 10 2006
|
|
EXTENSIONS
|
Definition corrected by Franklin T. Adams-Watters, Mar 13 2006
More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 09 2006
|
|
|
Search completed in 0.002 seconds
|