login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

Number of permutations p of [2+n] such that n is the maximum of the number of elements in any integer interval [p(i)..i+(2+n)*[i<p(i)]].
3

%I #8 Mar 10 2019 15:09:51

%S 0,1,1,11,60,435,3473,31315,313227,3445641,41341502,537313583,

%T 7520316423,112771887719,1803821926465,30656189582521,551659191788556,

%U 10478765887885181,209522984620760153,4398943767896801309,96755196700729056267,2224901906327124750355

%N Number of permutations p of [2+n] such that n is the maximum of the number of elements in any integer interval [p(i)..i+(2+n)*[i<p(i)]].

%H Alois P. Heinz, <a href="/A324622/b324622.txt">Table of n, a(n) for n = 0..448</a>

%F a(n) = A000179(n+2) - A000183(n+2).

%Y Row n=2 of A324563 and column of A324564 (as array).

%Y Cf. A000179, A000183.

%K nonn

%O 0,4

%A _Alois P. Heinz_, Mar 09 2019