|
|
A073331
|
|
Smallest k such that S(n) = d(n+k), where S(n) is the Kempner function (A002034) and d(n) is the number of divisors of n (A000005).
|
|
4
|
|
|
1, 1, 2, 11, 3, 57, 2, 3, 6, 1013, 2, 4083, 50, 1, 2, 65519, 2, 262125, 61, 43, 1002, 4194281, 2, 23, 4070, 9, 36, 268435427, 51, 1073741793, 8, 991, 65502, 29, 8, 68719476699, 262106, 4057, 41, 1099511627735, 22, 4398046511061, 980, 5, 4194258, 70368744177617
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
2,3
|
|
LINKS
|
|
|
MATHEMATICA
|
kemp[n_] := Module[{m = 1}, While[!IntegerQ[m!/n], m++]; m]; a[n_] := Module[{k = 1, s = kemp[n]}, While[DivisorSigma[0, n + k] != s, k++]; k]; Array[a, 20, 2] (* Amiram Eldar, Jan 20 2019 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|