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.

A114171 Least number m, a multiple of n, such that P(m*n) is prime, where P(k) is the number of partitions of k.

Table of values

n a(n)
1 2
2 1
3 1
4 1
5 1
6 1
7 11
8 21
9 4
10 44
11 7
12 3
13 1
14 12
15 35
16 81
17 1429
18 2
19 132
20 22
21 8
22 6
23 154
24 7
25 21
26 21
27 8
28 6
29 29
30 434
31 6
32 91
33 4
34 900
35 15
36 1
37 126
38 66
39 14
40 11
41 122
42 4
43 477
44 3
45 481
46 77
47 4
48 27
49 15
50 612
51 600
52 56
53 4
54 4
55 8
56 3
57 44
58 71
59 310
60 217
61 6
62 3
63 74
64 132
65 333
66 2
67 1146
68 450
69 1655
70 186
71 58
72 3

List of values

[2, 1, 1, 1, 1, 1, 11, 21, 4, 44, 7, 3, 1, 12, 35, 81, 1429, 2, 132, 22, 8, 6, 154, 7, 21, 21, 8, 6, 29, 434, 6, 91, 4, 900, 15, 1, 126, 66, 14, 11, 122, 4, 477, 3, 481, 77, 4, 27, 15, 612, 600, 56, 4, 4, 8, 3, 44, 71, 310, 217, 6, 3, 74, 132, 333, 2, 1146, 450, 1655, 186, 58, 3]