|
Search: id:A122828
|
|
|
| A122828 |
|
Triangle T(n,k), 0<=k<=n, defined by : T(n,k)=0 if k<0, T(n,k)=0 if k>n,T(0,0)=1, T(1,0)=1, T(1,1)=2, T(n,k)=T(n-1,k-1)+T(n-1,k)+T(n-2,k). |
|
+0
1
|
|
| 1, 1, 2, 2, 3, 2, 3, 7, 5, 2, 5, 13, 14, 7, 2, 8, 25, 32, 23, 9, 2, 13, 46, 71, 62, 34, 11, 2, 34, 151, 304, 367, 295, 163, 62, 15, 2, 55, 269, 604, 827, 767, 505, 238, 79, 17, 2
(list; table; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
FORMULA
|
Sum{k,0<=k<=n}T(n,k)=A078057(n) .T(n,0) = Fibonacci(n+1)=A000045(n+1).
|
|
EXAMPLE
|
Triangle begins:
1;
1, 2;
2, 3, 2;
3, 7, 5, 2;
5, 13, 14, 7, 2;
8, 25, 32, 23, 9, 2;
13, 46, 71, 62, 34, 11, 2;
21, 84, 149, 156, 105, 47, 13, 2;
34, 151, 304, 367, 295, 163, 62, 15, 2;
|
|
CROSSREFS
|
Sequence in context: A106245 A129568 A117122 this_sequence A035213 A083901 A038148
Adjacent sequences: A122825 A122826 A122827 this_sequence A122829 A122830 A122831
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Oct 23 2006
|
|
|
Search completed in 0.002 seconds
|
