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.

A367771 Number of ways to choose a different prime index of each prime index of 2n + 1.

Table of values

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

List of values

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

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.