cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A324622 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

This page as a plain text file.
%I A324622 #8 Mar 10 2019 15:09:51
%S A324622 0,1,1,11,60,435,3473,31315,313227,3445641,41341502,537313583,
%T A324622 7520316423,112771887719,1803821926465,30656189582521,551659191788556,
%U A324622 10478765887885181,209522984620760153,4398943767896801309,96755196700729056267,2224901906327124750355
%N A324622 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 A324622 Alois P. Heinz, <a href="/A324622/b324622.txt">Table of n, a(n) for n = 0..448</a>
%F A324622 a(n) = A000179(n+2) - A000183(n+2).
%Y A324622 Row n=2 of A324563 and column of A324564 (as array).
%Y A324622 Cf. A000179, A000183.
%K A324622 nonn
%O A324622 0,4
%A A324622 _Alois P. Heinz_, Mar 09 2019