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.

A241901 Number of nodes (partitions) in the largest 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 2
7 3
8 4
9 5
10 6
11 7
12 8
13 9
14 10
15 12
16 15
17 18
18 22
19 26
20 30
21 35
22 40
23 45
24 51
25 57
26 63
27 73
28 86
29 101
30 118
31 136
32 156
33 178
34 202
35 228
36 256
37 286
38 319
39 354
40 391
41 431
42 476
43 546
44 624
45 710
46 804
47 907
48 1020
49 1143
50 1277
51 1422

List of values

[1, 1, 2, 2, 2, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 15, 18, 22, 26, 30, 35, 40, 45, 51, 57, 63, 73, 86, 101, 118, 136, 156, 178, 202, 228, 256, 286, 319, 354, 391, 431, 476, 546, 624, 710, 804, 907, 1020, 1143, 1277, 1422]