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.

A217955 Triangular array read by rows. T(n,k) is the number of unlabeled graphs on n nodes that have exactly k distinct components (n >= 1).

Table of values

n a(n)
1 1
2 1
3 2
4 1
5 6
6 2
7 21
8 8
9 112
10 28
11 2
12 853
13 145
14 7
15 11117
16 1022
17 34
18 261080
19 12320
20 181
21 1
22 11716571
23 274785
24 1266
25 12
26 1006700565
27 12007355
28 14106
29 63
30 164059830476
31 1019030127
32 293756
33 407
34 50335907869219
35 165091859656
36 12362198
37 3023
38 6
39 29003487462848061
40 50502058491413
41 1032671168
42 33035
43 51
44 31397381142761241960
45 29054157815353374
46 166176421788
47 645086
48 399
49 63969560113225176176277
50 31426486309136268658
51 50672459139597
52 25830118
53 3113

List of values

[1, 1, 2, 1, 6, 2, 21, 8, 112, 28, 2, 853, 145, 7, 11117, 1022, 34, 261080, 12320, 181, 1, 11716571, 274785, 1266, 12, 1006700565, 12007355, 14106, 63, 164059830476, 1019030127, 293756, 407, 50335907869219, 165091859656, 12362198, 3023, 6, 29003487462848061, 50502058491413, 1032671168, 33035, 51, 31397381142761241960, 29054157815353374, 166176421788, 645086, 399, 63969560113225176176277, 31426486309136268658, 50672459139597, 25830118, 3113]