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.

A259531 Least positive integer k such that p(k)^2 + p(k*n)^2 is prime, where p(.) is the partition function given by A000041, or 0 if no such k exists.

Table of values

n a(n)
1 1
2 1
3 14
4 11
5 6
6 31
7 2
8 34
9 2
10 76
11 1
12 100
13 71
14 38
15 1
16 7
17 62
18 1128
19 1
20 180
21 123
22 15
23 174
24 128
25 4
26 111
27 110
28 2
29 4
30 2
31 2241
32 21
33 144
34 416
35 397
36 31
37 11
38 8
39 15
40 5
41 91
42 56
43 53
44 23
45 89
46 18
47 25
48 341
49 12
50 1
51 66
52 454
53 159
54 36
55 573
56 26
57 2
58 488
59 72
60 416
61 802
62 440
63 28
64 30
65 595
66 17
67 236
68 947
69 1289
70 1287
71 1000
72 367
73 80
74 407
75 1
76 77
77 938
78 150
79 36
80 1

List of values

[1, 1, 14, 11, 6, 31, 2, 34, 2, 76, 1, 100, 71, 38, 1, 7, 62, 1128, 1, 180, 123, 15, 174, 128, 4, 111, 110, 2, 4, 2, 2241, 21, 144, 416, 397, 31, 11, 8, 15, 5, 91, 56, 53, 23, 89, 18, 25, 341, 12, 1, 66, 454, 159, 36, 573, 26, 2, 488, 72, 416, 802, 440, 28, 30, 595, 17, 236, 947, 1289, 1287, 1000, 367, 80, 407, 1, 77, 938, 150, 36, 1]