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.

A306738 Number of permutations of [n] allowing i->i+j (mod n), j=0..ceiling(n/2)-1.

Table of values

n a(n)
0 1
1 1
2 1
3 2
4 2
5 13
6 20
7 144
8 264
9 2783
10 6208
11 79118
12 204448
13 3182225
14 9411840
15 170576156
16 566725760
17 11804363619
18 43573050368
19 1023207993178
20 4152609019392
21 108681408827381
22 481065936784384
23 13880706183899752

List of values

[1, 1, 1, 2, 2, 13, 20, 144, 264, 2783, 6208, 79118, 204448, 3182225, 9411840, 170576156, 566725760, 11804363619, 43573050368, 1023207993178, 4152609019392, 108681408827381, 481065936784384, 13880706183899752]

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

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