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.

A204900 Least k such that n divides s(k)-s(j) for some j in [1,k), where s(k) is the k-th odd prime.

Table of values

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

List of values

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

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

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