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.

A217653 Triangular array read by rows: T(n,k) is the number of unlabeled simple graphs with n nodes that have exactly k isolated nodes, (n>=0, 0<=k<=n).

Table of values

n a(n)
0 1
1 0
2 1
3 1
4 0
5 1
6 2
7 1
8 0
9 1
10 7
11 2
12 1
13 0
14 1
15 23
16 7
17 2
18 1
19 0
20 1
21 122
22 23
23 7
24 2
25 1
26 0
27 1
28 888
29 122
30 23
31 7
32 2
33 1
34 0
35 1
36 11302
37 888
38 122
39 23
40 7
41 2
42 1
43 0
44 1
45 262322
46 11302
47 888
48 122
49 23
50 7
51 2
52 1
53 0
54 1
55 11730500
56 262322
57 11302
58 888
59 122
60 23
61 7
62 2
63 1
64 0
65 1

List of values

[1, 0, 1, 1, 0, 1, 2, 1, 0, 1, 7, 2, 1, 0, 1, 23, 7, 2, 1, 0, 1, 122, 23, 7, 2, 1, 0, 1, 888, 122, 23, 7, 2, 1, 0, 1, 11302, 888, 122, 23, 7, 2, 1, 0, 1, 262322, 11302, 888, 122, 23, 7, 2, 1, 0, 1, 11730500, 262322, 11302, 888, 122, 23, 7, 2, 1, 0, 1]