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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A324629 Number of permutations p of [9+n] such that n is the maximum of the number of elements in any integer interval [p(i)..i+(9+n)*[i<p(i)]]. 2

%I #4 Mar 13 2019 16:02:29

%S 0,1,1,322,4993,151401,3188384,73575295,1638376021,37296199680,

%T 862203161593,20436051653561,497587696258955,12467167386012869,

%U 321709005522260383,8554048660846031618

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

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

%K nonn

%O 0,4

%A _Alois P. Heinz_, Mar 09 2019

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 17 23:23 EDT 2024. Contains 371767 sequences. (Running on oeis4.)