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.

A132803 Number of simple permutations in S_n, i.e., those whose "cycle graph" (or "breakpoint graph") only contains alternating cycles of length at most 3.

This page as a plain text file.
%I A132803 #9 Jan 10 2017 02:30:51
%S A132803 1,2,6,16,48,204,876,3636,18756,105480,561672
%N A132803 Number of simple permutations in S_n, i.e., those whose "cycle graph" (or "breakpoint graph") only contains alternating cycles of length at most 3.
%H A132803 J.-P. Doignon and A. Labarre, <a href="http://www.cs.uwaterloo.ca/journals/JIS/VOL10/Doignon/doignon77.html">On Hultman Numbers</a>, J. Integer Seq., 10 (2007), 13 pages.
%K A132803 nonn,more
%O A132803 1,2
%A A132803 _Anthony Labarre_, Nov 21 2007