A275479 Least positive k such that d(n) divides d(n+k) (d = A000005).
1, 1, 2, 5, 1, 2, 1, 2, 3, 4, 1, 6, 1, 1, 6, 32, 1, 2, 1, 8, 1, 2, 1, 6, 3, 1, 3, 4, 1, 10, 1, 12, 1, 1, 3, 64, 1, 1, 1, 2, 1, 12, 1, 1, 5, 5, 1, 32, 1, 2, 3, 8, 1, 2, 1, 10, 1, 2, 1, 12, 1, 3, 5, 128, 1, 4, 1, 4, 1, 8, 1, 12, 1, 3, 1, 8, 1, 10, 1, 32, 31, 2, 1, 6, 1, 1, 1, 14, 1, 6, 2, 4, 1, 1, 1, 12, 1, 1, 9, 80
Offset: 1
Keywords
Examples
a(10) = 4 because A000005(10) divides A000005(10+4).
Links
- Antti Karttunen, Table of n, a(n) for n = 1..20000
Programs
-
PARI
a(n) = {my(k = 1); while(numdiv(n+k) % numdiv(n) != 0, k++); k; }
Extensions
Data section extended up to a(100) by Antti Karttunen, Mar 02 2023
Comments