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!)
A276842 Number of permutations of [n] such that for each cycle c the smallest integer interval containing all elements of c has at most eight elements. 3

%I #6 Sep 20 2016 18:44:55

%S 1,1,2,6,24,120,720,5040,40320,181440,756000,3160080,13602600,

%T 60926580,285159966,1396646055,7158444465,35019420060,165994449732,

%U 774542703708,3596199290264,16729008975792,78297230499296,369560004222048,1760728654735744,8392003472443920

%N Number of permutations of [n] such that for each cycle c the smallest integer interval containing all elements of c has at most eight elements.

%H Alois P. Heinz, <a href="/A276842/b276842.txt">Table of n, a(n) for n = 0..1000</a>

%H Alois P. Heinz, <a href="/A276842/a276842.txt">G.f. for A276842</a>

%F G.f.: see link above.

%Y Column k=8 of A276837.

%Y Cf. A276724.

%K nonn,easy

%O 0,3

%A _Alois P. Heinz_, Sep 20 2016

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 September 5 08:10 EDT 2024. Contains 375696 sequences. (Running on oeis4.)