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.

A257662 Least prime q such that p(q*n) is prime, where p(.) is the partition function given by A000041.

Table of values

n a(n)
1 2
2 2
3 2
4 47
5 1481
6 31
7 11
8 557
9 277
10 1847
11 7
12 3
13 1861
14 47
15 1451
16 557
17 1429
18 2
19 18367
20 2069
21 13411
22 463
23 26731
24 7
25 50119
26 61
27 101
28 877
29 29
30 11261
31 2971
32 421
33 298589
34 32633
35 31
36 55933
37 5521
38 7307
39 22349
40 11
41 641
42 13
43 47881
44 3
45 2309
46 51673
47 94309
48 186679
49 136207
50 1301

List of values

[2, 2, 2, 47, 1481, 31, 11, 557, 277, 1847, 7, 3, 1861, 47, 1451, 557, 1429, 2, 18367, 2069, 13411, 463, 26731, 7, 50119, 61, 101, 877, 29, 11261, 2971, 421, 298589, 32633, 31, 55933, 5521, 7307, 22349, 11, 641, 13, 47881, 3, 2309, 51673, 94309, 186679, 136207, 1301]