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.

A204917 Least j such that n divides s(k)-s(j) for some k>j, where s(j)=(prime(j))^2.

Table of values

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

List of values

[1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 4, 1, 2, 1, 3, 7, 3, 1, 4, 1, 2, 1, 4, 1, 3, 1, 5, 2, 4, 11, 4, 1, 2, 1, 5, 1, 3, 1, 7, 13, 3, 1, 8, 1, 4, 15, 9, 1, 2, 1, 7, 1, 4]