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.

A204908 Least k such that n divides s(k)-s(j) for some j in [1,k], where s(k) is the k-th prime >=5.

Table of values

n a(n)
1 2
2 2
3 3
4 3
5 5
6 3
7 6
8 4
9 7
10 5
11 8
12 5
13 9
14 6
15 10
16 7
17 11
18 7
19 12
20 9
21 13
22 8
23 14
24 8
25 16
26 9
27 15
28 11
29 18
30 10
31 17
32 10
33 18
34 11
35 21
36 11
37 20
38 12
39 21
40 13
41 22
42 13
43 23
44 16
45 23
46 14
47 24
48 14
49 25
50 16

List of values

[2, 2, 3, 3, 5, 3, 6, 4, 7, 5, 8, 5, 9, 6, 10, 7, 11, 7, 12, 9, 13, 8, 14, 8, 16, 9, 15, 11, 18, 10, 17, 10, 18, 11, 21, 11, 20, 12, 21, 13, 22, 13, 23, 16, 23, 14, 24, 14, 25, 16]