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.

A333266 a(n) is the smallest number k such that for all m >= k there is at least one prime partition of m with prime(n) as least part.

Table of values

n a(n)
1 4
2 8
3 15
4 24
5 39
6 49
7 67
8 83
9 89
10 115
11 127
12 143
13 163
14 179
15 193
16 223
17 235
18 249
19 271
20 281
21 295
22 333
23 349
24 363
25 387
26 403
27 409
28 427
29 461
30 483
31 515
32 535
33 545
34 565
35 595
36 625
37 643
38 659
39 685
40 703
41 725
42 733
43 759
44 805
45 813
46 835
47 851
48 895
49 907
50 923
51 937
52 965
53 989
54 1033

List of values

[4, 8, 15, 24, 39, 49, 67, 83, 89, 115, 127, 143, 163, 179, 193, 223, 235, 249, 271, 281, 295, 333, 349, 363, 387, 403, 409, 427, 461, 483, 515, 535, 545, 565, 595, 625, 643, 659, 685, 703, 725, 733, 759, 805, 813, 835, 851, 895, 907, 923, 937, 965, 989, 1033]