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.

A360093 a(n) is the smallest positive integer which can be represented as the sum of distinct partition numbers in exactly n ways, or -1 if no such integer exists.

Table of values

n a(n)
1 1
2 3
3 8
4 15
5 18
6 23
7 30
8 33
9 38
10 43
11 45
12 48
13 56
14 58
15 63
16 71
17 74
18 -1
19 78
20 80
21 85
22 90
23 93
24 100
25 101
26 106
27 104
28 109
29 113
30 115
31 119
32 122
33 130
34 -1
35 134
36 135
37 145
38 141
39 150
40 153
41 146
42 149
43 163
44 156
45 158
46 165
47 167
48 173
49 -1
50 176
51 178
52 182
53 181
54 -1
55 183
56 186
57 196
58 193
59 191
60 199

List of values

[1, 3, 8, 15, 18, 23, 30, 33, 38, 43, 45, 48, 56, 58, 63, 71, 74, -1, 78, 80, 85, 90, 93, 100, 101, 106, 104, 109, 113, 115, 119, 122, 130, -1, 134, 135, 145, 141, 150, 153, 146, 149, 163, 156, 158, 165, 167, 173, -1, 176, 178, 182, 181, -1, 183, 186, 196, 193, 191, 199]