A048932 - cp's OEIS frontend

A048932 Let d(n) = number of distinct primes dividing n (A001221). Find smallest t such that d(t)=d(t+1)=...=d(t+n-1) but d(t-1) and d(t+n) are not = d(t); then a(n)=t.

n	a(n)
1	1
2	14
3	7
4	2
5	54
6	91
7	323
8	141
9	44360
10	48919
11	218972
12	534078
13	2699915
14	526095
15	17233173
16	127890362
17	29138958036
18	146216247221
19	118968284928
20	2500769994070
21	3157129230489
22	22498525938216
23	585927201062
24	313978488186061
25	571560399902283
26	453918847597184

[1, 14, 7, 2, 54, 91, 323, 141, 44360, 48919, 218972, 534078, 2699915, 526095, 17233173, 127890362, 29138958036, 146216247221, 118968284928, 2500769994070, 3157129230489, 22498525938216, 585927201062, 313978488186061, 571560399902283, 453918847597184]

cp's OEIS Frontend

A048932 Let d(n) = number of distinct primes dividing n (A001221). Find smallest t such that d(t)=d(t+1)=...=d(t+n-1) but d(t-1) and d(t+n) are not = d(t); then a(n)=t.

Table of values

List of values