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.

A084269 Triangle read by rows: T(n,k) is the number of simple connected graphs on n unlabeled nodes having chromatic number k, 1 <= k <= n.

Table of values

n a(n)
0 1
1 0
2 1
3 0
4 1
5 1
6 0
7 3
8 2
9 1
10 0
11 5
12 12
13 3
14 1
15 0
16 17
17 64
18 26
19 4
20 1
21 0
22 44
23 475
24 282
25 46
26 5
27 1
28 0
29 182
30 5036
31 5009
32 809
33 74
34 6
35 1
36 0
37 730
38 80947
39 149551
40 27794
41 1940
42 110
43 7
44 1
45 0
46 4032
47 2010328
48 7694428
49 1890221
50 113272
51 4125
52 156
53 8
54 1
55 0
56 25598
57 76115143
58 667036310
59 248580644
60 14545025
61 389583
62 8040
63 212
64 9
65 1

List of values

[1, 0, 1, 0, 1, 1, 0, 3, 2, 1, 0, 5, 12, 3, 1, 0, 17, 64, 26, 4, 1, 0, 44, 475, 282, 46, 5, 1, 0, 182, 5036, 5009, 809, 74, 6, 1, 0, 730, 80947, 149551, 27794, 1940, 110, 7, 1, 0, 4032, 2010328, 7694428, 1890221, 113272, 4125, 156, 8, 1, 0, 25598, 76115143, 667036310, 248580644, 14545025, 389583, 8040, 212, 9, 1]