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.

A235939 Number of circular permutations with exactly one (unspecified) increasing or decreasing modular 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 5
6 12
7 77
8 496
9 3672
10 30560
11 284031
12 2913624
13 32724939
14 399561428
15 5270747880
16 74717040128
17 1132896574609
18 18297399806532
19 313634823814769
20 5686864630734840
21 108757303793301240

List of values

[0, 0, 0, 0, 5, 12, 77, 496, 3672, 30560, 284031, 2913624, 32724939, 399561428, 5270747880, 74717040128, 1132896574609, 18297399806532, 313634823814769, 5686864630734840, 108757303793301240]

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

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