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.

A235938 Number of circular permutations with exactly one specified increasing or decreasing modular run (3-sequence), with clockwise and counterclockwise traversals counted as distinct.

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 2
6 4
7 22
8 124
9 816
10 6112
11 51642
12 485604
13 5034606
14 57080204
15 702766384
16 9339630016
17 133281949954
18 2033044422948
19 33014191980502
20 568686463073484
21 10357838456504880

List of values

[0, 0, 0, 0, 2, 4, 22, 124, 816, 6112, 51642, 485604, 5034606, 57080204, 702766384, 9339630016, 133281949954, 2033044422948, 33014191980502, 568686463073484, 10357838456504880]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.