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.

A331539 a(n) gives the number of primes of form (2*n+1)*2^m + 1 where m satisfies 2^m <= 2*n+1.

Table of values

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

List of values

[1, 1, 1, 1, 3, 2, 1, 2, 1, 0, 2, 1, 2, 2, 2, 0, 1, 2, 2, 4, 1, 1, 1, 0, 1, 2, 2, 1, 2, 1, 1, 3, 3, 2, 2, 2, 2, 4, 1, 1, 3, 2, 2, 2, 1, 0, 3, 3, 2, 4, 1, 0, 3, 1, 1, 2, 2, 1, 3, 2, 0, 1, 2, 1, 2, 2, 2, 4, 1, 1, 4, 0, 1, 0, 2, 1, 2, 2, 0, 2, 2, 3, 5, 1, 1, 0, 1]