|
Search: id:A026148
|
|
|
| A026148 |
|
Triangular array T read by rows: T(i,0)=1 for i >= 0, T(1,1)=1,T(2,1)=1,T(2,2)=2,T(2,3)=1,T(2,4)= 1, and for i >= 3, T(i,1)=i-1, T(i,i+2)=T(i-1,i)+T(i-1,i-1), T(i,j)=T(i-1,j-2)+T(i-1,j-1)+T(i-1,j) for j=2,3,....,i+1. For n >= 2, T(n,k)=number of nonneg. int. strings s(0),...,s(n) such that s(n)=n-k, s(0)=2, |s(1)-2|=1, and {s(i)-s(i-1)|<=1 for i >= 2. |
|
+0
25
|
|
| 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 4, 4, 4, 2, 1, 3, 7, 10, 12, 10, 6, 1, 4, 11, 20, 29, 32, 28, 16, 1, 5, 16, 35, 60, 81, 89, 76, 44, 1, 6, 22, 56, 111, 176, 230, 246, 209, 120, 1, 7, 29, 84, 189, 343, 517, 652, 685, 575, 329, 1, 8, 37, 120, 302, 616, 1049, 1512, 1854, 1912, 1589, 904, 1, 9, 46, 165
(list; table; graph; listen)
|
|
|
|
|
Search completed in 0.002 seconds
|
