A086770 - cp's OEIS frontend

A086770 Numbers k such that the difference between the largest and the smallest prime divisor of k equals the number of prime divisors of k (counted with multiplicity).

n	a(n)
1	1
2	15
3	20
4	30
5	35
6	50
7	112
8	143
9	168
10	189
11	252
12	280
13	315
14	323
15	378
16	392
17	420
18	441
19	525
20	588
21	630
22	700
23	735
24	882
25	899
26	980
27	1029
28	1050
29	1372
30	1470
31	1750
32	1763
33	2058
34	2450
35	2816
36	3430
37	3599
38	3773
39	4224
40	4802
41	5183
42	5929
43	6336
44	7040
45	9317
46	9504
47	9856
48	10403

[1, 15, 20, 30, 35, 50, 112, 143, 168, 189, 252, 280, 315, 323, 378, 392, 420, 441, 525, 588, 630, 700, 735, 882, 899, 980, 1029, 1050, 1372, 1470, 1750, 1763, 2058, 2450, 2816, 3430, 3599, 3773, 4224, 4802, 5183, 5929, 6336, 7040, 9317, 9504, 9856, 10403]

cp's OEIS Frontend

A086770 Numbers k such that the difference between the largest and the smallest prime divisor of k equals the number of prime divisors of k (counted with multiplicity).

Table of values

List of values