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.

A236483 a(n) = |{0 < k < n-2: p(k) + 2^(phi(n-k)/2) is prime}|, where p(.) is the partition function (A000041) and phi(.) is Euler's totient function.

Table of values

n a(n)
1 0
2 0
3 0
4 1
5 1
6 2
7 3
8 2
9 3
10 5
11 4
12 3
13 6
14 1
15 6
16 5
17 7
18 7
19 5
20 6
21 4
22 6
23 5
24 4
25 7
26 4
27 6
28 5
29 5
30 6
31 9
32 6
33 13
34 6
35 10
36 5
37 6
38 7
39 4
40 10
41 9
42 12
43 6
44 12
45 3
46 8
47 8
48 9
49 11
50 8
51 11
52 7
53 11
54 7
55 8
56 8
57 9
58 8
59 10
60 10
61 9
62 9
63 14
64 8
65 15
66 8
67 11
68 13
69 12
70 12
71 15
72 13
73 12
74 8
75 11
76 12
77 10
78 11
79 12
80 12
81 13
82 8
83 12
84 14
85 8
86 13
87 10
88 8
89 8
90 12
91 8
92 15
93 11
94 10
95 11
96 11
97 13
98 14
99 10
100 8

List of values

[0, 0, 0, 1, 1, 2, 3, 2, 3, 5, 4, 3, 6, 1, 6, 5, 7, 7, 5, 6, 4, 6, 5, 4, 7, 4, 6, 5, 5, 6, 9, 6, 13, 6, 10, 5, 6, 7, 4, 10, 9, 12, 6, 12, 3, 8, 8, 9, 11, 8, 11, 7, 11, 7, 8, 8, 9, 8, 10, 10, 9, 9, 14, 8, 15, 8, 11, 13, 12, 12, 15, 13, 12, 8, 11, 12, 10, 11, 12, 12, 13, 8, 12, 14, 8, 13, 10, 8, 8, 12, 8, 15, 11, 10, 11, 11, 13, 14, 10, 8]