The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
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
Sequence in context: A297204 A071088 A177533 * A122417 A321008 A033644
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Feb 17 2024
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 18 19:02 EDT 2024. Contains 373486 sequences. (Running on oeis4.)