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.

A332401 Irregular triangle read by rows: T(n,k) is the number of simple connected graphs on n unlabeled nodes with domination number k, n >= 1, 1 <= k <= A065033(n+1).

Table of values

n a(n)
1 1
2 1
3 2
4 4
5 2
6 11
7 10
8 34
9 76
10 2
11 156
12 655
13 42
14 1044
15 9162
16 905
17 6
18 12346
19 219823
20 28720
21 191
22 274668
23 9864065
24 1568173
25 9644
26 21

List of values

[1, 1, 2, 4, 2, 11, 10, 34, 76, 2, 156, 655, 42, 1044, 9162, 905, 6, 12346, 219823, 28720, 191, 274668, 9864065, 1568173, 9644, 21]

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

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