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.

A296079 a(n) = 1 if 1+phi(n) is prime, 0 otherwise, where phi = A000010, Euler totient function.

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0]