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.

A130275 Number of degree-n permutations such that number of cycles of size 2k is odd (or zero) for every k.

Table of values

n a(n)
0 1
1 1
2 2
3 6
4 21
5 105
6 675
7 4725
8 35805
9 322245
10 3236625
11 35602875
12 425872755
13 5536345815
14 77347084815
15 1160206272225
16 18403556596425
17 312860462139225
18 5643104418376425
19 107218983949152075
20 2136610763952639975
21 44868826043005439475
22 986129980012277775675

List of values

[1, 1, 2, 6, 21, 105, 675, 4725, 35805, 322245, 3236625, 35602875, 425872755, 5536345815, 77347084815, 1160206272225, 18403556596425, 312860462139225, 5643104418376425, 107218983949152075, 2136610763952639975, 44868826043005439475, 986129980012277775675]