A324628 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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”).

Other ways to Give

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)]].

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

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

CROSSREFS

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

Sequence in context: A117594 A052188 A086977 * A216346 A289819 A195523

Adjacent sequences: A324625 A324626 A324627 * A324629 A324630 A324631

KEYWORD

nonn

AUTHOR

Alois P. Heinz, Mar 09 2019

STATUS

approved