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

A071541
Number of k's less than or equal to 10^n such that there are middle divisors of k (A071562).
1
6, 43, 336, 2932, 26870, 252756, 2409731, 23169860, 224059958, 2175865640
OFFSET
1,1
FORMULA
a(n) = 10^n - A071540(n). - Amiram Eldar, Jul 27 2024
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
Robert G. Wilson v, May 31 2002
EXTENSIONS
a(8) from Sean A. Irvine, Jul 25 2024
a(9)-a(10) from Amiram Eldar, Jul 27 2024
STATUS
approved