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.

A263342 Irregular triangle read by rows: T(n,k) is the number of unlabeled graphs with n vertices containing exactly k non-isomorphic induced subgraphs, 1 <= n <= k < A370001(n).

Table of values

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

List of values

[1, 2, 2, 2, 2, 2, 5, 2, 2, 0, 1, 8, 4, 10, 7, 2, 2, 0, 0, 4, 4, 6, 6, 14, 16, 14, 22, 16, 20, 16, 10, 4, 2, 2, 0, 0, 0, 0, 4, 4, 4, 10, 8, 8, 16, 10, 20, 32, 42, 36, 40, 48, 74, 56, 68, 76, 60, 74, 72, 60, 72, 64, 26, 34, 14, 8, 2]