login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A324629 Number of permutations p of [9+n] such that n is the maximum of the number of elements in any integer interval [p(i)..i+(9+n)*[i<p(i)]]. 2
0, 1, 1, 322, 4993, 151401, 3188384, 73575295, 1638376021, 37296199680, 862203161593, 20436051653561, 497587696258955, 12467167386012869, 321709005522260383, 8554048660846031618 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

LINKS

Table of n, a(n) for n=0..15.

CROSSREFS

Row n=9 of A324563 and column of A324564 (as array).

Sequence in context: A237406 A234712 A234705 * A234704 A266885 A253368

Adjacent sequences:  A324626 A324627 A324628 * A324630 A324631 A324632

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 24 22:49 EDT 2019. Contains 326314 sequences. (Running on oeis4.)