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.

A236344 a(n) = |{0 < k < n: m = phi(k)/2 + phi(n-k)/12 is an integer with 2^m + prime(m) prime}|, where phi(.) is Euler's totient function.

Table of values

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

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 1, 1, 1, 2, 1, 2, 3, 4, 2, 4, 3, 5, 2, 3, 4, 3, 3, 4, 6, 5, 6, 6, 7, 7, 5, 4, 6, 6, 5, 7, 5, 3, 3, 3, 7, 4, 5, 5, 8, 4, 6, 5, 5, 5, 6, 4, 5, 4, 5, 4, 3, 4, 5, 6, 3, 6, 9, 6, 9, 8, 13, 5, 11, 5, 6, 7, 11, 4, 9, 9, 5, 6, 6, 11, 7, 8, 9, 9, 4]