|
|
A071541
|
|
Number of k's less than or equal to 10^n such that there are middle divisors of k (A071562).
|
|
1
|
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
FORMULA
|
|
|
MATHEMATICA
|
f[n_] := Plus @@ Select[ Divisors[n], Sqrt[n/2] <= # < Sqrt[n*2] &]; s = 0; k = 0; Do[ While[k < 10^n, k++; If[ f[k] != 0, s++ ]]; Print[s], {n, 1, 7}]
|
|
PROG
|
(PARI) lista(nmax) = {my(c = 0, pow = 10); for(k = 1, 10^nmax, if(sumdiv(k, d, if(d^2 >= k/2 && d^2 < 2*k, d, 0)) > 0, c++); if(k == pow, print1(c, ", "); pow *= 10)); } \\ Amiram Eldar, Jul 27 2024
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|