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.

A076732 Table T(n,k) giving number of ways of obtaining exactly one correct answer on an (n,k)-matching problem (1 <= k <= n).

Table of values

n a(n)
1 1
2 1
3 0
4 1
5 2
6 3
7 1
8 4
9 9
10 8
11 1
12 6
13 21
14 44
15 45
16 1
17 8
18 39
19 128
20 265
21 264
22 1
23 10
24 63
25 284
26 905
27 1854
28 1855
29 1
30 12
31 93
32 536
33 2325
34 7284
35 14833
36 14832
37 1
38 14
39 129
40 908
41 5005
42 21234
43 65821
44 133496
45 133497
46 1
47 16
48 171
49 1424
50 9545
51 51264
52 214459
53 660064
54 1334961
55 1334960

List of values

[1, 1, 0, 1, 2, 3, 1, 4, 9, 8, 1, 6, 21, 44, 45, 1, 8, 39, 128, 265, 264, 1, 10, 63, 284, 905, 1854, 1855, 1, 12, 93, 536, 2325, 7284, 14833, 14832, 1, 14, 129, 908, 5005, 21234, 65821, 133496, 133497, 1, 16, 171, 1424, 9545, 51264, 214459, 660064, 1334961, 1334960]