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.

A341765 Consider gaps between successive odd primes from 3 up to prime(n+2). Let k1 be number of gaps congruent to 2 (mod 6) and let k2 be number of gaps congruent to 4 (mod 6). Then a(n) = k1 - k2.

Table of values

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

List of values

[1, 2, 1, 2, 1, 2, 1, 1, 2, 2, 1, 2, 1, 1, 1, 2, 2, 1, 2, 2, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 1, 2, 1, 2, 2, 2, 1, 1, 1, 2, 1, 2, 1, 2, 2, 2, 1, 2, 1, 1, 2, 1, 1, 1, 1, 2, 2, 1, 2, 1, 2, 1, 2, 1, 2, 2, 1, 2, 1, 1, 2, 2, 2, 1, 1, 2, 1, 2, 1, 2, 1, 2, 2, 1, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 1, 1, 2, 2, 2, 1, 1, 1, 2, 2]