Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #5 Sep 21 2016 11:36:59
%S 1,1,2,6,24,120,720,5040,40320,362880,1814400,8316000,37920960,
%T 176833800,852972120,4277399490,22346336880,121693555905,690665206113,
%U 3742590924108,19625337285660,101084160732660,516806625700056,2640952527095376,13549247936670720
%N Number of permutations of [n] such that for each cycle c the smallest integer interval containing all elements of c has at most nine elements.
%H Alois P. Heinz, <a href="/A276843/b276843.txt">Table of n, a(n) for n = 0..128</a>
%Y Column k=9 of A276837.
%Y Cf. A276725.
%K nonn
%O 0,3
%A _Alois P. Heinz_, Sep 20 2016