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.

A057963 Triangle T(n,k) of number of minimal 2-covers of a labeled n-set that cover k points of that set uniquely (k=2,..,n).

Table of values

n a(n)
2 1
3 3
4 3
5 6
6 12
7 7
8 10
9 30
10 35
11 15
12 15
13 60
14 105
15 90
16 31
17 21
18 105
19 245
20 315
21 217
22 63
23 28
24 168
25 490
26 840
27 868
28 504
29 127
30 36
31 252
32 882
33 1890
34 2604
35 2268
36 1143
37 255
38 45
39 360
40 1470
41 3780
42 6510
43 7560
44 5715
45 2550
46 511
47 55
48 495
49 2310
50 6930
51 14322
52 20790
53 20955
54 14025

List of values

[1, 3, 3, 6, 12, 7, 10, 30, 35, 15, 15, 60, 105, 90, 31, 21, 105, 245, 315, 217, 63, 28, 168, 490, 840, 868, 504, 127, 36, 252, 882, 1890, 2604, 2268, 1143, 255, 45, 360, 1470, 3780, 6510, 7560, 5715, 2550, 511, 55, 495, 2310, 6930, 14322, 20790, 20955, 14025]