A374870 - cp's OEIS frontend

A374870 Let e(m) be the sum of all values of k satisfying the equation: (m mod k = floor((m - k)/k) mod k), minus 2*m (1 <= k <= m); then a(n) is the smallest m for which e(m) = n, or 0 if no e(m) has value n.

n	a(n)
0	39
1	23
2	5847
3	735
4	65
5	29
6	35
7	77
8	111
9	173
10	415
11	185
12	79
13	47
14	113
15	137
16	317
17	867
18	307
19	543
20	4843
21	2153
22	1203
23	161
24	59
25	159
26	351
27	531
28	1577
29	475
30	617
31	89
32	5321
33	95
34	11405
35	1371
36	107
37	83
38	219
39	197
40	199
41	1855
42	365
43	6521
44	3667
45	8597
46	131

[39, 23, 5847, 735, 65, 29, 35, 77, 111, 173, 415, 185, 79, 47, 113, 137, 317, 867, 307, 543, 4843, 2153, 1203, 161, 59, 159, 351, 531, 1577, 475, 617, 89, 5321, 95, 11405, 1371, 107, 83, 219, 197, 199, 1855, 365, 6521, 3667, 8597, 131]

cp's OEIS Frontend

A374870 Let e(m) be the sum of all values of k satisfying the equation: (m mod k = floor((m - k)/k) mod k), minus 2*m (1 <= k <= m); then a(n) is the smallest m for which e(m) = n, or 0 if no e(m) has value n.

Table of values

List of values