|
Search: id:A026747
|
|
|
| A026747 |
|
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 even and 1<=k<=n/2, else T(n,k)=T(n-1,k-1)+T(n-1,k). |
|
+0
30
|
|
| 1, 1, 1, 1, 3, 1, 1, 4, 4, 1, 1, 6, 11, 5, 1, 1, 7, 17, 16, 6, 1, 1, 9, 30, 44, 22, 7, 1, 1, 10, 39, 74, 66, 29, 8, 1, 1, 12, 58, 143, 184, 95, 37, 9, 1, 1, 13, 70, 201, 327, 279, 132, 46, 10, 1, 1, 15, 95, 329, 671, 790, 411, 178, 56, 11, 1, 1, 16
(list; table; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
FORMULA
|
T(n, k) = number of paths from (0, 0) to (n-k, k) in the 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)-to-(i+1, 2h+i+1) for i >= 0, h>=0.
|
|
CROSSREFS
|
Sequence in context: A026626 A136482 A026648 this_sequence A026374 A102716 A134510
Adjacent sequences: A026744 A026745 A026746 this_sequence A026748 A026749 A026750
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu)
|
|
|
Search completed in 0.002 seconds
|
