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.

A205146 Least k such that n divides s(k)-s(j) for some j satisfying 1<=j where s(j)=prime(j)*prime(j+1).

Table of values

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

List of values

[2, 3, 2, 3, 3, 4, 4, 5, 2, 3, 5, 5, 6, 4, 7, 5, 7, 5, 8, 3, 4, 5, 9, 6, 12, 6, 5, 7, 3, 7, 4, 5, 5, 7, 15, 5, 12, 8, 6, 8, 7, 4, 6, 7, 7, 9, 10, 6, 8, 12, 7, 10, 16, 5, 16, 13, 8, 10, 9, 7, 16, 4, 10, 5, 14, 5, 8, 10, 20, 16, 4, 6, 18, 12, 14, 13, 7, 6, 9, 11]