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.

A076731 Table T(n,k) giving number of ways of obtaining exactly 0 correct answers on an (n,k)-matching problem (1 <= k <= n).

Table of values

n a(n)
1 0
2 1
3 1
4 2
5 3
6 2
7 3
8 7
9 11
10 9
11 4
12 13
13 32
14 53
15 44
16 5
17 21
18 71
19 181
20 309
21 265
22 6
23 31
24 134
25 465
26 1214
27 2119
28 1854
29 7
30 43
31 227
32 1001
33 3539
34 9403
35 16687
36 14833
37 8
38 57
39 356
40 1909
41 8544
42 30637
43 82508
44 148329
45 133496
46 9
47 73
48 527
49 3333
50 18089
51 81901
52 296967
53 808393

List of values

[0, 1, 1, 2, 3, 2, 3, 7, 11, 9, 4, 13, 32, 53, 44, 5, 21, 71, 181, 309, 265, 6, 31, 134, 465, 1214, 2119, 1854, 7, 43, 227, 1001, 3539, 9403, 16687, 14833, 8, 57, 356, 1909, 8544, 30637, 82508, 148329, 133496, 9, 73, 527, 3333, 18089, 81901, 296967, 808393]