|
|
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
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
|
|
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
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|