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.

A276843 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.

This page as a plain text file.
%I A276843 #5 Sep 21 2016 11:36:59
%S A276843 1,1,2,6,24,120,720,5040,40320,362880,1814400,8316000,37920960,
%T A276843 176833800,852972120,4277399490,22346336880,121693555905,690665206113,
%U A276843 3742590924108,19625337285660,101084160732660,516806625700056,2640952527095376,13549247936670720
%N A276843 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 A276843 Alois P. Heinz, <a href="/A276843/b276843.txt">Table of n, a(n) for n = 0..128</a>
%Y A276843 Column k=9 of A276837.
%Y A276843 Cf. A276725.
%K A276843 nonn
%O A276843 0,3
%A A276843 _Alois P. Heinz_, Sep 20 2016