A191000 - cp's OEIS frontend

A191000 Greedy inverse of A034690: the smallest number m such that sum of digits of all divisors of m equals n; a(n) = 0 if no such number exists.

n	a(n)
1	1
2	0
3	2
4	3
5	13
6	5
7	4
8	7
9	10
10	0
11	19
12	6
13	9
14	21
15	8
16	403
17	79
18	34
19	12
20	39
21	35
22	16
23	129
24	38
25	133
26	52
27	30
28	100
29	28
30	18
31	81
32	63
33	24
34	75
35	333
36	66
37	64
38	117
39	99
40	243
41	76
42	60
43	889
44	171
45	88
46	36
47	279
48	54
49	484
50	387
51	78
52	48
53	475
54	136
55	1209
56	208
57	132
58	729
59	112
60	258
61	225
62	84
63	90
64	399
65	1396
66	162
67	741
68	796

[1, 0, 2, 3, 13, 5, 4, 7, 10, 0, 19, 6, 9, 21, 8, 403, 79, 34, 12, 39, 35, 16, 129, 38, 133, 52, 30, 100, 28, 18, 81, 63, 24, 75, 333, 66, 64, 117, 99, 243, 76, 60, 889, 171, 88, 36, 279, 54, 484, 387, 78, 48, 475, 136, 1209, 208, 132, 729, 112, 258, 225, 84, 90, 399, 1396, 162, 741, 796]

cp's OEIS Frontend

A191000 Greedy inverse of A034690: the smallest number m such that sum of digits of all divisors of m equals n; a(n) = 0 if no such number exists.

Table of values

List of values