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.

A325962 a(1) = 1; for n > 1, a(n) is the largest k <= 1+A046666(n) such that n-k and n-(sigma(n)-k) are relatively prime, or -1 if no such nonnegative k exists.

Table of values

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

List of values

[1, 1, 0, 3, 0, 5, 0, 7, 7, 9, 0, 11, 0, 13, 10, 15, 0, 17, 0, 19, 18, 21, 0, 23, 21, 25, 24, 27, 0, 29, 0, 31, 28, 33, 30, 35, 0, 37, 36, 39, 0, 41, 0, 43, 40, 45, 0, 47, 43, 49, 44, 51, 0, 53, 50, 55, 54, 57, 0, 59, 0, 61, 60, 63, 60, 65, 0, 67, 64, 69, 0, 71, 0, 73, 72, 75, 70, 77, 0, 79, 79, 81, 0, 83, 80, 85, 82, 87, 0, 89, 82]