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.

A110176 Least k such that sigma(n) = sigma(k) + sigma(n-k) for 0 or 0 if there is no such k, where sigma is the sum of divisors function.

Table of values

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

List of values

[0, 0, 1, 0, 0, 0, 0, 2, 4, 2, 0, 0, 0, 0, 5, 0, 0, 0, 0, 2, 7, 0, 0, 0, 0, 0, 0, 0, 0, 6, 0, 4, 11, 0, 0, 0, 0, 0, 13, 10, 0, 0, 0, 0, 0, 0, 0, 0, 8, 0, 17, 0, 0, 0, 12, 14, 19, 0, 0, 0, 0, 17, 19, 0, 0, 0, 0, 0, 14, 14, 0, 0, 0, 0, 25, 0, 0, 0, 0, 0, 0, 0, 0, 0, 38, 0, 22, 22, 0, 18, 0, 30, 31, 19, 0, 12]