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.

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

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 1
6 2
7 11
8 62
9 408
10 3056
11 25821
12 242802
13 2517303
14 28540102
15 351383192
16 4669815008
17 66640974977
18 1016522211474
19 16507095990251
20 284343231536742
21 5178919228252440

List of values

[0, 0, 0, 0, 1, 2, 11, 62, 408, 3056, 25821, 242802, 2517303, 28540102, 351383192, 4669815008, 66640974977, 1016522211474, 16507095990251, 284343231536742, 5178919228252440]

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

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