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.

A263690 Number of length n arrays of permutations of 0..n-1 with each element moved by -n to n places and every three consecutive elements having its maximum within 3 of its minimum.

Table of values

n a(n)
0 1
1 1
2 2
3 6
4 24
5 36
6 36
7 48
8 80
9 128
10 200
11 288
12 432
13 648
14 992
15 1496
16 2272
17 3424
18 5192
19 7840
20 11880
21 17952
22 27184
23 41096
24 62208
25 94072
26 142368
27 215328
28 325832
29 492864
30 745736
31 1128096
32 1706800
33 2582024
34 3906464
35 5909784
36 8941024
37 13526368
38 20464072
39 30959200

List of values

[1, 1, 2, 6, 24, 36, 36, 48, 80, 128, 200, 288, 432, 648, 992, 1496, 2272, 3424, 5192, 7840, 11880, 17952, 27184, 41096, 62208, 94072, 142368, 215328, 325832, 492864, 745736, 1128096, 1706800, 2582024, 3906464, 5909784, 8941024, 13526368, 20464072, 30959200]