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”).

A275478
Least k such that d(n) divides d(n+2^k) (d = A000005).
2
0, 0, 1, 3, 0, 1, 0, 1, 4, 2, 0, 3, 0, 0, 7, 5, 0, 1, 0, 3, 0, 1, 0, 4, 7, 0, 3, 2, 0, 8, 0, 6, 0, 0, 2, 6, 0, 0, 0, 1, 0, 7, 0, 0, 23, 3, 0, 5, 0, 1, 2, 3, 0, 1, 0, 5, 0, 1, 0, 9, 0, 2, 9, 7, 0, 2, 0, 2, 0, 3, 0, 7, 0, 2, 0, 3, 0, 5, 0, 5, 178, 1, 0, 8, 0, 0, 0, 4, 0, 24, 1, 2, 0, 0, 0, 6, 0, 0, 20, 9
OFFSET
1,4
COMMENTS
a(225) > 300, if it exists. - Antti Karttunen, Jun 13 2023
LINKS
FORMULA
a(A057922(n)) = 0. - Michel Marcus, Aug 01 2016
EXAMPLE
a(45) = 23 because A000005(45) = 6 divides A000005(45+2^23) = 18.
MATHEMATICA
A275478[n_]:=Module[{d=DivisorSigma[0, n], k=-1}, While[!Divisible[DivisorSigma[0, n+2^++k], d]]; k]; Array[A275478, 50] (* Paolo Xausa, Aug 13 2023 *)
PROG
(PARI) a(n) = {my(k = 0); while(numdiv(n+2^k) % numdiv(n) != 0, k++); k; }
CROSSREFS
KEYWORD
nonn
AUTHOR
Altug Alkan, Jul 29 2016
EXTENSIONS
Data section extended up to a(100) by Antti Karttunen, Mar 02 2023
STATUS
approved