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.
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.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =2a(5) =1a(6) =1a(7) =3a(8) =2a(9) =1a(10) =1a(11) =4a(12) =4a(13) =2a(14) =1a(15) =1a(16) =5a(17) =7a(18) =4a(19) =2a(20) =1a(21) =1a(22) =6a(23) =11a(24) =8a(25) =4a(26) =2a(27) =1a(28) =1a(29) =7
External references
- oeis: A052509