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.

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

Table of values

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

List of values

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