cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A071540 Number of k's less than or equal to 10^n such that there are no middle divisors of k (A071561).

Original entry on oeis.org

4, 57, 664, 7068, 73130, 747244, 7590269, 76830140, 775940042, 7824134360
Offset: 1

Views

Author

Robert G. Wilson v, May 31 2002

Keywords

Crossrefs

Programs

  • 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}]
  • 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

Formula

a(n) = 10^n - A071541(n). - Amiram Eldar, Jul 27 2024

Extensions

a(8) from Sean A. Irvine, Jul 24 2024
a(9)-a(10) from Amiram Eldar, Jul 27 2024