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.

A333417 a(n) is the greatest number k having for every prime <= 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.

Table of values

n a(n)
1 4
2 9
3 16
4 27
5 35
6 49
7 63
8 65
9 85
10 95
11 105
12 121
13 135
14 145
15 169
16 175
17 187
18 203
19 207
20 221
21 253
22 265
23 273
24 289
25 301
26 305
27 319
28 351
29 369
30 387
31 403
32 407
33 425
34 445
35 473
36 485
37 495
38 517
39 529
40 545
41 551
42 567
43 611
44 615
45 629
46 637
47 671
48 679
49 693
50 697
51 725
52 747
53 781
54 793
55 799

List of values

[4, 9, 16, 27, 35, 49, 63, 65, 85, 95, 105, 121, 135, 145, 169, 175, 187, 203, 207, 221, 253, 265, 273, 289, 301, 305, 319, 351, 369, 387, 403, 407, 425, 445, 473, 485, 495, 517, 529, 545, 551, 567, 611, 615, 629, 637, 671, 679, 693, 697, 725, 747, 781, 793, 799]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.