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.

A342068 a(n) is the smallest k > 1 such that there are more primes in the interval [(k-1)*n + 1, k*n] than there are in the interval [(k-2)*n + 1, (k-1)*n].

Table of values

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

List of values

[2, 6, 10, 5, 3, 7, 5, 3, 5, 5, 7, 4, 11, 3, 5, 5, 7, 3, 4, 3, 7, 4, 5, 5, 5, 6, 6, 9, 3, 6, 8, 4, 6, 5, 7, 5, 5, 6, 5, 5, 7, 4, 9, 6, 4, 10, 3, 3, 4, 4, 7, 4, 6, 4, 5, 5, 4, 5, 4, 8, 6, 7, 7, 5, 10, 6, 3, 3, 6, 4, 4, 4, 4, 4, 4, 9, 8, 6, 6, 6, 3, 5, 6, 5, 6, 5]