|
Search: id:A026703
|
|
|
| A026703 |
|
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 k=[ n/2 ] or k=[ (n+1)/2 ], else T(n,k)=T(n-1,k-1)+T(n-1,k). |
|
+0
16
|
|
| 1, 1, 1, 1, 3, 1, 1, 5, 5, 1, 1, 6, 13, 6, 1, 1, 7, 24, 24, 7, 1, 1, 8, 31, 61, 31, 8, 1, 1, 9, 39, 116, 116, 39, 9, 1, 1, 10, 48, 155, 293, 155, 48, 10, 1, 1, 11, 58, 203, 564, 564, 203, 58, 11, 1, 1, 12, 69, 261, 767, 1421, 767, 261, 69, 12, 1
(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, j)-to-(i+1, j+1) if |i-j|<=1.
|
|
CROSSREFS
|
Adjacent sequences: A026700 A026701 A026702 this_sequence A026704 A026705 A026706
Sequence in context: A134836 A131767 A026780 this_sequence A122917 A096583 A130154
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu)
|
|
|
Search completed in 0.002 seconds
|
