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.

A124002 Triangle T(n,k) of the number of unlabeled graphs on n nodes with existential reconstruction number k, 3<=k<=n. ERN(G) is the minimum number of vertex-deleted subgraphs of G required to uniquely reconstruct G up to isomorphism.

Table of values

n a(n)
3 4
4 8
5 3
6 34
7 0
8 0
9 150
10 4
11 2
12 0
13 1044
14 0
15 0
16 0
17 0
18 12334
19 8
20 2
21 2
22 0
23 0
24 274666
25 0
26 2
27 0
28 0
29 0
30 0
31 12005156
32 6
33 4
34 0
35 2
36 0
37 0
38 0

List of values

[4, 8, 3, 34, 0, 0, 150, 4, 2, 0, 1044, 0, 0, 0, 0, 12334, 8, 2, 2, 0, 0, 274666, 0, 2, 0, 0, 0, 0, 12005156, 6, 4, 0, 2, 0, 0, 0]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.