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.

A375934 Numbers whose prime factorization has a second-largest exponent that equals 1.

Original entry on oeis.org

12, 18, 20, 24, 28, 40, 44, 45, 48, 50, 52, 54, 56, 60, 63, 68, 75, 76, 80, 84, 88, 90, 92, 96, 98, 99, 104, 112, 116, 117, 120, 124, 126, 132, 135, 136, 140, 147, 148, 150, 152, 153, 156, 160, 162, 164, 168, 171, 172, 175, 176, 180, 184, 188, 189, 192, 198, 204
Offset: 1

Views

Author

Amiram Eldar, Sep 03 2024

Keywords

Comments

First differs from A332785 at n = 112: A332785(112) = 360 = 2^3 * 3^2 * 5 is not a term of this sequence.
First differs from A317616 at n = 38: A317616(38) = 144 = 2*4 * 3^2 is not a term of this sequence.
Numbers k such that A375933(k) = 1.
Numbers of the form s1 * s2^e, where s1 and s2 are coprime squarefree numbers that are both larger than 1, and e >= 2.
The asymptotic density of this sequence is Sum_{e>=2} d(e) = 0.36113984820338109927..., where d(e) = Product_{p prime} (1 - 1/p^2 + 1/p^e - 1/p^(e+1)) - Product_{p prime} (1 - 1/p^(e+1)) is the asymptotic density of terms k with A051903(k) = e >= 2.

Crossrefs

Programs

  • Mathematica
    q[n_] := Module[{e = FactorInteger[n][[;; , 2]]}, Max[0, Max[Select[e, # < Max[e] &]]] == 1]; Select[Range[300], q]
  • PARI
    is(n) = if(n == 1, 0, my(e = factor(n)[,2]); e = select(x -> x < vecmax(e), e); if(#e == 0, 0, vecmax(e) == 1));

Formula

A051904(a(n)) = 1.
A051903(a(n)) >= 2.
A001221(a(n)) = 2.