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.

Previous Showing 11-14 of 14 results.

A381312 Numbers whose powerful part (A057521) is a power of a prime with an odd exponent >= 3 (A056824).

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, 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, 544
Offset: 1

Views

Author

Amiram Eldar, Feb 19 2025

Keywords

Comments

Subsequence of A301517 and A374459 and first differs from them at n = 21. A301517(21) = A374459(21) = 216 is not a term of this sequence.
Numbers having exactly one non-unitary prime factor and its multiplicity is odd.
Numbers whose prime signature (A118914) is of the form {1, 1, ..., 2*m+1} with m >= 1, i.e., any number (including zero) of 1's and then a single odd number > 1.
The asymptotic density of this sequence is (1/zeta(2)) * Sum_{p prime} 1/((p-1)*(p+1)^2) = 0.093382464285953613312...

Crossrefs

Programs

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

A360906 Numbers with the same number of cubefree divisors and 3-full divisors.

Original entry on oeis.org

1, 16, 81, 384, 625, 640, 896, 1296, 1408, 1664, 2176, 2401, 2432, 2944, 3712, 3968, 4374, 4736, 5248, 5504, 6016, 6784, 7552, 7808, 8576, 9088, 9216, 9344, 10000, 10112, 10624, 10935, 11392, 12416, 12928, 13184, 13696, 13952, 14464, 14641, 15309, 16256, 16768
Offset: 1

Views

Author

Amiram Eldar, Feb 25 2023

Keywords

Comments

Numbers k such that A073184(k) = A190867(k).
Numbers whose largest cubefree divisor (A007948) and cubefull part (A360540) have the same number of divisors (A000005).
If k and m are coprime terms, then k*m is also a term.
The characteristic function of this sequence depends only on prime signature.
1 is the only cubefree (A004709) term.
Includes the 4th powers of squarefree numbers (1 and A113849).
The 4th powers of primes (A030514) are the only terms that are prime powers (A246655).
Numbers of the for m*p^(3*2^k+1), where m is squarefree, p is prime, gcd(m, p) = 1 and omega(m) = k, are all terms. In particular, this sequence includes numbers of the form p^7*q, where p != q are primes (A179664), and numbers of the form p^13*q*r where p, q, and r are distinct primes.
The corresponding numbers of cubefree (or 3-full) divisors are 1, 3, 3, 6, 3, 6, 6, 9, 6, 6, 6, 3, 6, 6, ... .

Crossrefs

Programs

  • Mathematica
    q[n_] := Module[{e = FactorInteger[n][[;; , 2]]}, Times @@ (Min[#, 3] & /@ (e + 1)) == Times @@ (Max[#, 1] & /@ (e - 1))]; q[1] = True; Select[Range[10^4], q]
  • PARI
    is(k) = {my(e = factor(k)[,2]); prod(i = 1, #e, min(e[i] + 1, 3)) == prod(i = 1, #e, max(e[i] - 1, 1)); }

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.

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));
Previous Showing 11-14 of 14 results.