login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A275279
Least k such that d(k*n) = d(k*(n+1)), or 0 if no such k exists (d = A000005).
0
0, 1, 2, 2, 12, 12, 4, 12, 2, 20, 72, 72, 28, 1, 6, 8, 108, 108, 160, 2, 1, 44, 288, 12, 2, 1, 2, 224, 10800, 10800, 16, 36, 1, 1, 6, 864, 76, 1, 4, 800, 21168, 21168, 352, 1, 3, 92, 1152, 24, 10, 4, 2, 416, 648, 9, 4, 4, 1, 116, 259200, 259200, 124
OFFSET
1,3
EXAMPLE
a(4) = 2 because A000005(2*4) = A000005(2*5).
PROG
(PARI) a(n) = if(n==1, 0, {my(k = 1); while (numdiv(k*n) != numdiv(k*(n+1)), k++); k; })
CROSSREFS
Cf. A000005.
Sequence in context: A327874 A190295 A228154 * A109767 A339297 A196061
KEYWORD
nonn
AUTHOR
Altug Alkan, Jul 28 2016
STATUS
approved