Table read by upward antidiagonals: T(n,k) is the number of strings of length k over an n-letter alphabet that do not begin with a palindrome of two or more letters; n, k >= 1.
A342238
Table read by upward antidiagonals: T(n,k) is the number of strings of length k over an n-letter alphabet that do not begin with a palindrome of two or more letters; n, k >= 1.
Terms
- a(0) =1a(1) =2a(2) =0a(3) =3a(4) =2a(5) =0a(6) =4a(7) =6a(8) =2a(9) =0a(10) =5a(11) =12a(12) =12a(13) =2a(14) =0a(15) =6a(16) =20a(17) =36a(18) =30a(19) =2a(20) =0a(21) =7a(22) =30a(23) =80a(24) =132a(25) =78a(26) =2a(27) =0a(28) =8a(29) =42
External references
- oeis: A342238