A134382 - cp's OEIS frontend

A134382 a(n) is the smallest number k larger than a(n-1) such that nd(k)sopf(k)=sigma(k), where d is the number of divisors (A000005) and sopf the sum of prime factors without repetition (A008472).

n	a(n)
1	20
2	140
3	464
4	660
5	1276
6	1365
7	2204
8	2508
9	2805
10	2907
11	5590
12	5698
13	5742
14	6006
15	7395
16	8680
17	14645
18	15052
19	18875
20	19170
21	19740
22	23871
23	34579
24	34804
25	35164
26	35244
27	35934
28	38121
29	106805
30	114953
31	261536
32	503082

[20, 140, 464, 660, 1276, 1365, 2204, 2508, 2805, 2907, 5590, 5698, 5742, 6006, 7395, 8680, 14645, 15052, 18875, 19170, 19740, 23871, 34579, 34804, 35164, 35244, 35934, 38121, 106805, 114953, 261536, 503082]

cp's OEIS Frontend

A134382 a(n) is the smallest number k larger than a(n-1) such that nd(k)sopf(k)=sigma(k), where d is the number of divisors (A000005) and sopf the sum of prime factors without repetition (A008472).

Table of values

List of values

cp's OEIS Frontend

A134382 a(n) is the smallest number k larger than a(n-1) such that n*d(k)*sopf(k)=sigma(k), where d is the number of divisors (A000005) and sopf the sum of prime factors without repetition (A008472).

Table of values

List of values

A134382 a(n) is the smallest number k larger than a(n-1) such that nd(k)sopf(k)=sigma(k), where d is the number of divisors (A000005) and sopf the sum of prime factors without repetition (A008472).