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.

A276975 Number of permutations of [n] such that the minimal distance between elements of the same cycle equals one, a(1)=1 by convention.

Table of values

n a(n)
1 1
2 1
3 4
4 19
5 103
6 651
7 4702
8 38413
9 350559
10 3539511
11 39196758
12 472612883
13 6165080443
14 86526834271
15 1300282224846
16 20832761552453
17 354515666646827
18 6386139146435035
19 121406489336263622
20 2429193186525638435
21 51030147426536745655
22 1122952442325988152627

List of values

[1, 1, 4, 19, 103, 651, 4702, 38413, 350559, 3539511, 39196758, 472612883, 6165080443, 86526834271, 1300282224846, 20832761552453, 354515666646827, 6386139146435035, 121406489336263622, 2429193186525638435, 51030147426536745655, 1122952442325988152627]