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.

A085234 (Greatest power of smallest prime factor of n) < square root(n).

Original entry on oeis.org

6, 10, 14, 15, 18, 20, 21, 22, 26, 28, 30, 33, 34, 35, 36, 38, 39, 42, 44, 46, 50, 51, 52, 54, 55, 57, 58, 60, 62, 65, 66, 68, 69, 70, 72, 74, 75, 76, 77, 78, 82, 84, 85, 86, 87, 88, 90, 91, 92, 93, 94, 95, 98, 99, 100, 102, 104, 105, 106, 108, 110, 111, 114, 115
Offset: 1

Views

Author

Reinhard Zumkeller, Jun 22 2003

Keywords

Comments

A028233(a(n))^2 < a(n);
a(n)=A085232(n) for n<69: a(69)=120, A085232(69)=122=a(70).

Programs

  • Maple
    isA085234 := proc(n)
        if A028233(n)^2 < n then
            true;
        else
            false;
        end if;
    end proc:
    for n from 1 to 115 do
        if isA085234(n) then
            printf("%d,",n);
        end if;
    end do: # R. J. Mathar, Jul 09 2016
  • Mathematica
    okQ[n_] := Power @@ FactorInteger[n][[1]] < Sqrt[n]; Select[Range[120], okQ] (* Jean-François Alcover, Feb 13 2018 *)