STATUS
reviewed
approved
reviewed
approved
proposed
reviewed
editing
proposed
Table read by upward antidiagonals: T(n,k) is the number of strings of length k over a an n-letter alphabet that are bifix free; n >= 1, k >= 1.
approved
editing
proposed
approved
editing
proposed
nonn,new,tabl
approved
editing
proposed
approved
editing
proposed
Peter Kagey, <a href="/A342239/b342239.txt">Table of n, a(n) for Antidiagonals n = 1..5050100, flattened</a>
proposed
editing