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.

A204892 Least k such that n divides s(k)-s(j) for some j in [1,k), where s(k)=prime(k).

Table of values

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

List of values

[2, 3, 3, 4, 4, 5, 7, 5, 5, 6, 6, 7, 10, 7, 7, 8, 8, 9, 13, 9, 9, 10, 16, 10, 16, 10, 10, 11, 11, 12, 19, 12, 20, 12, 12, 13, 22, 13, 13, 14, 14, 15, 24, 15, 15, 16, 25, 16, 26, 16, 16, 17, 29, 17, 30, 17, 17, 18, 18, 19, 31, 19, 32, 19, 19, 20, 33, 20, 20, 21]

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

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