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.

A381311 Numbers whose powerful part (A057521) is a power of a prime with an even exponent >= 2.

Original entry on oeis.org

4, 9, 12, 16, 18, 20, 25, 28, 44, 45, 48, 49, 50, 52, 60, 63, 64, 68, 75, 76, 80, 81, 84, 90, 92, 98, 99, 112, 116, 117, 121, 124, 126, 132, 140, 147, 148, 150, 153, 156, 162, 164, 169, 171, 172, 175, 176, 188, 192, 198, 204, 207, 208, 212, 220, 228, 234, 236
Offset: 1

Views

Author

Amiram Eldar, Feb 19 2025

Keywords

Comments

Numbers k whose largest unitary divisor that is a square, A350388(k), is a prime power (A246655), or equivalently, A350388(k) is in A056798 \ {1}.
Numbers having exactly one non-unitary prime factor and its multiplicity is even.
Numbers whose prime signature (A118914) is of the form {1, 1, ..., 2*m} with m >= 1, i.e., any number (including zero) of 1's and then a single even number.
The asymptotic density of this sequence is (1/zeta(2)) * Sum_{p prime} p/((p-1)*(p+1)^2) = 0.24200684327095676029... .

Crossrefs

Programs

  • Mathematica
    q[n_] := Module[{e = ReverseSort[FactorInteger[n][[;;,2]]]}, EvenQ[e[[1]]] && (Length[e] == 1 || e[[2]] == 1)]; Select[Range[1000],q]
  • PARI
    isok(k) = if(k == 1, 0, my(e = vecsort(factor(k)[, 2], , 4)); !(e[1] % 2) && (#e == 1 || e[2] == 1));