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.

A325960 a(n) is k-n for the least k >= n+(A020639(n)-1) such that n-k and n-(sigma(n)-k) are relatively prime, or 0 if no such k <= sigma(n) exists.

Table of values

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

List of values

[0, 1, 0, 1, 0, 1, 0, 1, 2, 1, 0, 1, 0, 1, 5, 1, 0, 1, 0, 1, 3, 1, 0, 1, 4, 1, 3, 1, 0, 1, 0, 1, 5, 1, 5, 1, 0, 1, 3, 1, 0, 1, 0, 1, 5, 1, 0, 1, 6, 1, 7, 1, 0, 1, 5, 1, 3, 1, 0, 1, 0, 1, 3, 1, 5, 1, 0, 1, 5, 1, 0, 1, 0, 1, 3, 1, 7, 1, 0, 1, 2, 1, 0, 1, 5, 1, 5, 1, 0, 1, 9, 1, 3, 1, 9, 1, 0, 1, 5, 1, 0, 1, 0, 1, 5]