login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A370384
Number of permutations of [n] having no substring [k,k+1,k+2,k+3,k+4,k+5].
2
1, 1, 2, 6, 24, 120, 719, 5037, 40306, 362802, 3628296, 39913080, 478970641, 6226733531, 87175347936, 1307641346772, 20922387099240, 355682119243320, 6402298503373917, 121643960874649867, 2432883613692550316, 51090627024035616300, 1123995015882951892680
OFFSET
0,3
LINKS
D. M. Jackson and R. C. Read, A note on permutations without runs of given length, Aequationes Math. 17 (1978), no. 2-3, 336-343.
FORMULA
G.f.: Sum_{k>=0} k! * ( (x-x^6)/(1-x^6) )^k.
a(n) = Sum_{k=0..5} A184182(n,k). - Alois P. Heinz, Feb 17 2024
PROG
(PARI) my(N=30, x='x+O('x^N)); Vec(sum(k=0, N, k!*((x-x^6)/(1-x^6))^k))
CROSSREFS
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Feb 17 2024
STATUS
approved