|
Search: id:A052509
|
|
|
| A052509 |
|
Knights-move Pascal triangle: T(n,k), n >= 0, 0<=k<=n; T(n,0)=T(n,n)=1, T(n,k)=T(n-1,k)+T(n-2,k-1) for k=1,2,...,n-1, n >= 2. |
|
+0
13
|
|
| 1, 1, 1, 1, 2, 1, 1, 3, 2, 1, 1, 4, 4, 2, 1, 1, 5, 7, 4, 2, 1, 1, 6, 11, 8, 4, 2, 1, 1, 7, 16, 15, 8, 4, 2, 1, 1, 8, 22, 26, 16, 8, 4, 2, 1, 1, 9, 29, 42, 31, 16, 8, 4, 2, 1, 1, 10, 37, 64, 57, 32, 16, 8, 4, 2, 1, 1, 11, 46, 93, 99, 63, 32, 16, 8, 4, 2, 1, 1, 12, 56, 130, 163, 120, 64, 32
(list; table; graph; listen)
|
|
|
Search completed in 0.002 seconds
|
