login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A324625 Number of permutations p of [5+n] such that n is the maximum of the number of elements in any integer interval [p(i)..i+(5+n)*[i<p(i)]]. 2
0, 1, 1, 47, 406, 5320, 65209, 876865, 12428079, 187013213, 2977639454, 50100075551, 889030153223, 16605705694513, 325842147818131, 6704025812865230, 144359437306938642, 3247712172059705741, 76210676599647821811, 1862449116865631232577 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

LINKS

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

FORMULA

a(n) = A189389(n+5) - A184965(n+5).

CROSSREFS

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

Cf. A189389, A184965.

Sequence in context: A255141 A142694 A213216 * A239539 A217119 A142454

Adjacent sequences:  A324622 A324623 A324624 * A324626 A324627 A324628

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 December 7 20:39 EST 2021. Contains 349589 sequences. (Running on oeis4.)