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.

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

This page as a plain text file.
%I A324623 #6 Mar 10 2019 15:50:33
%S A324623 0,1,1,18,113,1001,9289,95747,1075779,13129188,173006731,2449243815,
%T A324623 37082963875,598045522873,10236223969309,185344819109346,
%U A324623 3539853769700281,71122126197951465,1499666213536206971,33113352117542113491,764116379880803291501
%N A324623 Number of permutations p of [3+n] such that n is the maximum of the number of elements in any integer interval [p(i)..i+(3+n)*[i<p(i)]].
%H A324623 Alois P. Heinz, <a href="/A324623/b324623.txt">Table of n, a(n) for n = 0..447</a>
%F A324623 a(n) = A000183(n+3) - A004307(n+3).
%Y A324623 Row n=3 of A324563 and column of A324564 (as array).
%Y A324623 Cf. A000183, A004307.
%K A324623 nonn
%O A324623 0,4
%A A324623 _Alois P. Heinz_, Mar 09 2019