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!)
A324628 Number of permutations p of [8+n] such that n is the maximum of the number of elements in any integer interval [p(i)..i+(8+n)*[i<p(i)]]. 2
0, 1, 1, 199, 2676, 65469, 1209129, 24330731, 483906047, 9919457739, 209006411538, 4550241332823, 102418431583071, 2385231119694273, 57488444625865101, 1433825413465384003, 36995367724604395132 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
LINKS
CROSSREFS
Row n=8 of A324563 and column of A324564 (as array).
Sequence in context: A117594 A052188 A086977 * A216346 A289819 A195523
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Mar 09 2019
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 July 18 06:54 EDT 2024. Contains 374377 sequences. (Running on oeis4.)