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.

A079267 d(n,s) = number of perfect matchings on {1, 2, ..., n} with s short pairs.

Table of values

n a(n)
0 1
1 0
2 1
3 1
4 1
5 1
6 5
7 6
8 3
9 1
10 36
11 41
12 21
13 6
14 1
15 329
16 365
17 185
18 55
19 10
20 1
21 3655
22 3984
23 2010
24 610
25 120
26 15
27 1
28 47844
29 51499
30 25914
31 7980
32 1645
33 231
34 21
35 1
36 721315
37 769159
38 386407
39 120274
40 25585
41 3850
42 406
43 28
44 1
45 12310199
46 13031514
47 6539679
48 2052309
49 446544
50 70371
51 8106
52 666
53 36
54 1

List of values

[1, 0, 1, 1, 1, 1, 5, 6, 3, 1, 36, 41, 21, 6, 1, 329, 365, 185, 55, 10, 1, 3655, 3984, 2010, 610, 120, 15, 1, 47844, 51499, 25914, 7980, 1645, 231, 21, 1, 721315, 769159, 386407, 120274, 25585, 3850, 406, 28, 1, 12310199, 13031514, 6539679, 2052309, 446544, 70371, 8106, 666, 36, 1]