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.

A298676 Number of partitions of n that can be uniquely recovered from their P-graphs.

Table of values

n a(n)
1 1
2 2
3 3
4 5
5 5
6 7
7 7
8 10
9 11
10 13
11 13
12 18
13 19
14 26
15 31
16 36
17 41
18 48
19 59
20 71
21 84
22 94
23 106
24 123
25 146
26 165
27 187
28 210
29 240
30 275
31 318
32 364
33 407
34 465
35 525
36 593
37 672
38 756
39 849
40 966
41 1080
42 1207
43 1354
44 1530
45 1718
46 1925
47 2135
48 2377
49 2667
50 2997
51 3351
52 3736
53 4141
54 4598
55 5125

List of values

[1, 2, 3, 5, 5, 7, 7, 10, 11, 13, 13, 18, 19, 26, 31, 36, 41, 48, 59, 71, 84, 94, 106, 123, 146, 165, 187, 210, 240, 275, 318, 364, 407, 465, 525, 593, 672, 756, 849, 966, 1080, 1207, 1354, 1530, 1718, 1925, 2135, 2377, 2667, 2997, 3351, 3736, 4141, 4598, 5125]