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.

Showing 1-3 of 3 results.

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));

A384520 Numbers whose powerful part (A057521) is greater than 1 and is equal to a squarefree number raised to an odd power (A384518).

Original entry on oeis.org

8, 24, 27, 32, 40, 54, 56, 88, 96, 104, 120, 125, 128, 135, 136, 152, 160, 168, 184, 189, 216, 224, 232, 243, 248, 250, 264, 270, 280, 296, 297, 312, 328, 343, 344, 351, 352, 375, 376, 378, 384, 408, 416, 424, 440, 456, 459, 472, 480, 486, 488, 512, 513, 520, 536
Offset: 1

Views

Author

Amiram Eldar, Jun 01 2025

Keywords

Comments

Subsequence of A301517 and A374459 and first differs from them at n = 85: A374459(85) = A374459(85) = 864 = 2^5 * 3^3 is not a term of this sequence.
First differs from its subsequence A381312 at n = 21: a(21) = 216 = 2^3 * 3^3 is not a term of A381312.
Numbers whose prime factorization has one distinct exponent that is larger than 1 and it is odd.
Numbers that are a product of a squarefree number (A005117) and a coprime nonsquarefree number that is a squarefree number raised to an odd power (A384518).
The asymptotic density of this sequence is Sum_{k>=1} (d(2*k+1)-1)/zeta(2) = 0.095609588748823080455..., where d(k) = (zeta(2*k)/zeta(k)) * Product_{p prime} (1 + 2/p^k + Sum_{i=k+1..2*k-1} (-1)^(i+1)/p^i).

Crossrefs

Intersection of A268335 and A375142.
Intersection of A295661 and A375142.
Intersection of A376142 and A375142.
Equals A375142 \ A384519.
Subsequence of A301517 and A374459.
Subsequences: A381312, A384518.

Programs

  • Mathematica
    q[n_] := Module[{u = Union[Select[FactorInteger[n][[;; , 2]], # > 1 &]]}, Length[u] == 1 && OddQ[u[[1]]]]; Select[Range[250], q]
  • PARI
    isok(k) = {my(e = select(x -> (x > 1), Set(factor(k)[, 2]))); #e == 1 && e[1] % 2;}

A381316 Numbers whose powerful part (A057521) is a power of a prime with an exponent >= 3 (A246549).

Original entry on oeis.org

8, 16, 24, 27, 32, 40, 48, 54, 56, 64, 80, 81, 88, 96, 104, 112, 120, 125, 128, 135, 136, 152, 160, 162, 168, 176, 184, 189, 192, 208, 224, 232, 240, 243, 248, 250, 256, 264, 270, 272, 280, 296, 297, 304, 312, 320, 328, 336, 343, 344, 351, 352, 368, 375, 376, 378
Offset: 1

Views

Author

Amiram Eldar, Feb 19 2025

Keywords

Comments

First differs from A344653 and A345193 at n = 17: a(17) = 120 is not a term of these sequences.
Numbers whose prime signature (A118914) is of the form {1, 1, ..., m} with m >= 3, i.e., any number (including zero) of 1's and then a single number >= 3.
The asymptotic density of this sequence is (1/zeta(2)) * Sum_{p prime} 1/(p*(p^2-1)) = A369632 / A013661 = 0.13463358553764438661... .

Crossrefs

Programs

  • Mathematica
    q[n_] := Module[{e = ReverseSort[FactorInteger[n][[;; , 2]]]}, e[[1]] > 2 && (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));
Showing 1-3 of 3 results.