A139416 - cp's OEIS frontend

A139416 a(n) is the smallest positive integer k such that d(k) = d(k+2n) = 2n, where d(m) (A000005) is the number of positive divisors of m, or 0 if no such k exists.

n	a(n)
1	3
2	6
3	12
4	70
5	600281
6	60
7	1458
8	264
9	450
10	266875
11	12670498046853
12	480
13	3998684814453099
14	11968722
15	299538
16	3640
17	49921080474853515591
18	1980
19	6107691150665283203125
20	14960
21	575047378296833
22	4068173828125
23	13936286848094463348388671875
24	6552
25	5035427051913

[3, 6, 12, 70, 600281, 60, 1458, 264, 450, 266875, 12670498046853, 480, 3998684814453099, 11968722, 299538, 3640, 49921080474853515591, 1980, 6107691150665283203125, 14960, 575047378296833, 4068173828125, 13936286848094463348388671875, 6552, 5035427051913]

cp's OEIS Frontend

A139416 a(n) is the smallest positive integer k such that d(k) = d(k+2n) = 2n, where d(m) (A000005) is the number of positive divisors of m, or 0 if no such k exists.

Table of values

List of values

cp's OEIS Frontend

A139416 a(n) is the smallest positive integer k such that d(k) = d(k+2*n) = 2*n, where d(m) (A000005) is the number of positive divisors of m, or 0 if no such k exists.

Table of values

List of values

A139416 a(n) is the smallest positive integer k such that d(k) = d(k+2n) = 2n, where d(m) (A000005) is the number of positive divisors of m, or 0 if no such k exists.