45132

Appears in sequences

• Number of "bifix-free" words of length n over a four-letter alphabet.at n=8A019309
• G.f.: A(x) = exp(sum(n>=1, A084250(n)*x^n/n)), where A084250 lists the least distinct positive integers that allow A(x) to be an integer power series.at n=42A084251
• A019309(n)/4 for n >= 1.at n=8A094547
• Row sums of triangle A129503.at n=42A129504
• Shifts 3 places left under Dirichlet convolution.at n=44A144367
• 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.at n=62A342239