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.

A347342 a(n) = prime(n) mod floor(prime(n) / n).

Table of values

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

List of values

[0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 1, 1, 2, 1, 1, 2, 2, 1, 2, 1, 2, 1, 2, 3, 3, 1, 3, 1, 3, 1, 3, 3, 1, 3, 1, 3, 1, 1, 3, 3, 3, 3, 1, 1, 3, 1, 3, 1, 3, 1, 3, 1, 1, 3, 1, 3, 3, 1, 1, 3, 1, 2, 1, 1, 3, 2, 3, 4, 3, 4, 2, 1, 4, 4, 1, 1, 3, 4, 3]