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.

A069870 Smallest prime that can be formed using a partition of n, or 0 if no such prime exists.

Table of values

n a(n)
1 0
2 2
3 3
4 13
5 5
6 0
7 7
8 17
9 0
10 19
11 11
12 0
13 13
14 59
15 0
16 79
17 17
18 0
19 19
20 137
21 0
22 139
23 23
24 0
25 223
26 179
27 0
28 127
29 29
30 0
31 31
32 131
33 0
34 277
35 233
36 0
37 37
38 137
39 0
40 139
41 41
42 0
43 43
44 359
45 0
46 379
47 47
48 0
49 409
50 149
51 0
52 151
53 53
54 0
55 487
56 353
57 0
58 157
59 59
60 0
61 61
62 359
63 0
64 163
65 263
66 0
67 67
68 167
69 0
70 367
71 71
72 0

List of values

[0, 2, 3, 13, 5, 0, 7, 17, 0, 19, 11, 0, 13, 59, 0, 79, 17, 0, 19, 137, 0, 139, 23, 0, 223, 179, 0, 127, 29, 0, 31, 131, 0, 277, 233, 0, 37, 137, 0, 139, 41, 0, 43, 359, 0, 379, 47, 0, 409, 149, 0, 151, 53, 0, 487, 353, 0, 157, 59, 0, 61, 359, 0, 163, 263, 0, 67, 167, 0, 367, 71, 0]