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.

A356169 a(n) = n - gcd(n, A003961(A356164(n))), where A356164(n) is the smallest positive k such that n divides k*A003961(k), and A003961 is fully multiplicative with a(p) = nextprime(p).

Table of values

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

List of values

[0, 1, 0, 3, 0, 3, 0, 7, 0, 5, 0, 9, 0, 7, 10, 15, 0, 9, 0, 15, 0, 11, 0, 21, 0, 13, 0, 21, 0, 15, 0, 31, 0, 17, 28, 27, 0, 19, 0, 35, 0, 21, 0, 33, 30, 23, 0, 45, 0, 25, 0, 39, 0, 27, 0, 49, 0, 29, 0, 45, 0, 31, 0, 63, 0, 33, 0, 51, 0, 63, 0, 63, 0, 37, 50, 57, 66, 39, 0, 75, 0, 41, 0, 63, 0, 43, 0, 77, 0, 75, 0, 69]