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.

A071166 a(n) = n - A006530(A000203(n)), difference between n and largest prime factor of the sum of its divisors.

Table of values

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

List of values

[-1, 1, -3, 2, 3, 5, 3, -4, 7, 8, 5, 6, 11, 12, -15, 14, 5, 14, 13, 19, 19, 20, 19, -6, 19, 22, 21, 24, 27, 29, 25, 30, 31, 32, 23, 18, 33, 32, 35, 34, 39, 32, 37, 32, 43, 44, 17, 30, 19, 48, 45, 50, 49, 52, 51, 52, 53, 54, 53, 30, 59, 50, -63, 58, 63, 50, 61, 66, 67, 68, 59, 36, 55, 44, 69, 74, 71, 74, 49, 70, 75, 76, 77, 82, 75, 82, 83]