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.

A241900 Irregular triangular array: T(n,k) = number of partitions (nodes) in the k-th component of the graph G'(n) obtained from the partition graph G(n) by deleting all partitions having repeated parts; G and G' are defined in Comments.

Table of values

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

List of values

[1, 1, 2, 2, 2, 1, 2, 2, 3, 2, 4, 2, 5, 2, 1, 6, 2, 2, 7, 3, 2, 8, 5, 2, 9, 7, 2, 10, 9, 2, 1, 12, 11, 2, 2, 15, 12, 3, 2, 18, 13, 5, 2, 22, 14, 8, 2, 26, 15, 11, 2, 30, 16, 15, 2, 1, 35, 20, 17, 2, 2, 40, 26, 18, 3, 2, 45, 33, 19, 5, 2, 51, 41, 20, 8, 2, 57]