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.

A330507 a(n) is the smallest number k having for every prime p <= prime(n) at least one prime partition with least part p, and no such partition having least part > prime(n). If no such k exists then a(n) = 0 (see comments).

Table of values

n a(n)
1 2
2 6
3 10
4 18
5 24
6 30
7 51
8 57
9 69
10 60
11 99
12 111
13 123
14 143
15 147
16 159
17 177
18 189
19 201
20 213
21 225
22 245
23 255
24 267
25 291
26 303
27 309
28 321
29 345
30 357
31 381
32 393
33 411
34 427
35 447
36 465
37 471
38 493
39 507
40 519
41 537
42 553
43 573
44 583
45 623
46 621
47 633
48 669
49 681
50 695
51 707
52 729
53 749
54 753
55 783

List of values

[2, 6, 10, 18, 24, 30, 51, 57, 69, 60, 99, 111, 123, 143, 147, 159, 177, 189, 201, 213, 225, 245, 255, 267, 291, 303, 309, 321, 345, 357, 381, 393, 411, 427, 447, 465, 471, 493, 507, 519, 537, 553, 573, 583, 623, 621, 633, 669, 681, 695, 707, 729, 749, 753, 783]