|
Search: id:A026758
|
|
|
| A026758 |
|
Triangular array T read by rows: T(n,0)=T(n,n)=1 for n >= 0; for n >= 2 and 1<=k<=n-1, T(n,k)=T(n-1,k-1)+T(n-2,k-1)+T(n-1,k) if n is odd and 1<=k<=(n-1)/2, else T(n,k)=T(n-1,k-1)+T(n-1,k). |
|
+0
30
|
|
| 1, 1, 1, 1, 2, 1, 1, 4, 3, 1, 1, 5, 7, 4, 1, 1, 7, 16, 11, 5, 1, 1, 8, 23, 27, 16, 6, 1, 1, 10, 38, 66, 43, 22, 7, 1, 1, 11, 48, 104, 109, 65, 29, 8, 1, 1, 13, 69, 190, 279, 174, 94, 37, 9, 1, 1, 14, 82, 259, 469, 453, 268, 131, 46, 10, 1, 1, 16, 109, 410
(list; table; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
FORMULA
|
T(n, k) = number of paths from (0, 0) to (n-k, k) in directed graph having vertices (i, j) and edges (i, j)-to-(i+1, j) and (i, j)-to-(i, j+1) for i, j >= 0 and edges (i, 2h+i+1)-to-(i+1, 2h+i+2) for i >= 0, h>=0.
|
|
CROSSREFS
|
Adjacent sequences: A026755 A026756 A026757 this_sequence A026759 A026760 A026761
Sequence in context: A123199 A112096 A026725 this_sequence A130523 A034363 A026769
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu)
|
|
|
Search completed in 0.002 seconds
|
