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.

A282668 Numbers m whose greatest divisor <= sqrt(m) is prime.

Original entry on oeis.org

4, 6, 8, 9, 10, 12, 14, 15, 18, 21, 22, 25, 26, 27, 30, 33, 34, 35, 38, 39, 40, 45, 46, 49, 50, 51, 55, 56, 57, 58, 62, 63, 65, 69, 70, 74, 75, 77, 82, 84, 85, 86, 87, 91, 93, 94, 95, 98, 105, 106, 111, 115, 118, 119, 121, 122, 123, 125, 129, 132, 133, 134
Offset: 1

Views

Author

Emmanuel Vantieghem, Feb 20 2017

Keywords

Comments

The squares of the primes are in the sequence.

Examples

			15 is a term since its biggest divisor <= sqrt(15) is 3 (this is a not sqrt(15)-smooth example).
18 is a term since its biggest divisor <= sqrt(18) is 3 (this is a sqrt(18)-smooth example).
24 is not a term since its biggest divisor <= sqrt(24) is 4 (this is a sqrt(24)-smooth counterexample).
42 is not a term since its biggest divisor <= sqrt(42) is 6 (this is a not sqrt(42)-smooth counterexample).
		

Crossrefs

Programs

  • Mathematica
    f[m_]:=Module[{A=Divisors[m],a},a=Length[A];A[[Floor[(a+1)/2]]]];
    Select[Range[176],PrimeQ[f[#]]&]

Formula

{n: A033676(n) in A000040}. - R. J. Mathar, Feb 23 2017