Table read by upward antidiagonals: T(n,k) is the number of strings of length k over an n-letter alphabet that are bifix free; n >= 1, k >= 1.
A342239
Table read by upward antidiagonals: T(n,k) is the number of strings of length k over an n-letter alphabet that are bifix free; n >= 1, k >= 1.
Terms
- a(0) =1a(1) =2a(2) =0a(3) =3a(4) =2a(5) =0a(6) =4a(7) =6a(8) =4a(9) =0a(10) =5a(11) =12a(12) =18a(13) =6a(14) =0a(15) =6a(16) =20a(17) =48a(18) =48a(19) =12a(20) =0a(21) =7a(22) =30a(23) =100a(24) =180a(25) =144a(26) =20a(27) =0a(28) =8a(29) =42
External references
- oeis: A342239