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.

A205153 Least k such that n divides s(k)-s(j) for some j where s(j)=(prime(j+1) + prime(j+2))/2.

Table of values

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

List of values

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

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

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