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.

A241815 Irregular triangular array : t(n, k) = number of vertices of degree k in graph S(n) of strict partitions, where two partitions have an edge if and only if their intersection is empty.

Table of values

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

List of values

[2, 2, 3, 1, 2, 1, 1, 3, 1, 1, 1, 2, 1, 1, 3, 1, 3, 1, 1, 2, 2, 2, 2, 1, 1, 3, 2, 4, 1, 1, 1, 2, 4, 2, 1, 4, 1, 3, 4, 4, 1, 4, 1, 1, 1, 3, 1, 5, 1, 4, 1, 2, 3, 1, 1, 6, 5, 6, 1, 1, 2, 2, 2, 1, 1, 2, 6, 1, 2, 5, 4, 3, 1, 2, 4, 1, 2, 6, 5, 1, 2, 8, 3, 2, 1, 1]