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.

A356165 a(n) = n minus the smallest positive k such that n divides k*A003961(k), where A003961 is fully multiplicative with a(p) = nextprime(p).

Table of values

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

List of values

[0, 0, 1, 0, 2, 4, 2, 0, 5, 4, 4, 8, 2, 4, 12, 0, 4, 14, 2, 8, 11, 8, 4, 16, 16, 4, 19, 8, 6, 24, 2, 0, 19, 8, 30, 32, 6, 4, 17, 16, 4, 32, 2, 16, 39, 8, 4, 32, 24, 32, 25, 8, 6, 46, 34, 16, 23, 12, 6, 48, 2, 4, 43, 0, 32, 52, 6, 16, 31, 60, 4, 64, 2, 12, 66, 8, 70, 56, 6, 32, 65, 8, 4, 64, 46, 4, 41, 32, 6, 84, 36]