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-5 of 5 results.

A360902 Numbers with the same number of squarefree divisors and powerful divisors.

Original entry on oeis.org

1, 4, 9, 25, 36, 48, 49, 80, 100, 112, 121, 162, 169, 176, 196, 208, 225, 272, 289, 304, 361, 368, 405, 441, 464, 484, 496, 529, 567, 592, 656, 676, 688, 720, 752, 841, 848, 891, 900, 944, 961, 976, 1008, 1053, 1072, 1089, 1136, 1156, 1168, 1200, 1225, 1250, 1264
Offset: 1

Views

Author

Amiram Eldar, Feb 25 2023

Keywords

Comments

Numbers k such that A034444(k) = A005361(k).
Numbers whose squarefree kernel (A007947) and powerful part (A057521) have the same number of divisors (A000005).
If k and m are coprime terms, then k*m is also a term.
All the terms are exponentially 2^n-numbers (A138302).
The characteristic function of this sequence depends only on prime signature.
Numbers whose canonical prime factorization has exponents whose geometric mean is 2.
Equivalently, numbers of the form Product_{i=1..m} p_i^(2^k_i), where p_i are distinct primes, and Sum_{i=1..m} k_i = m (i.e., the exponents k_i have an arithmetic mean 1).
1 is the only squarefree (A005117) term.
Includes the squares of squarefree numbers (A062503), which are the powerful (A001694) terms of this sequence.
The squares of primes (A001248) are the only terms that are prime powers (A246655).
Numbers of the for m*p^(2^k), where m is squarefree, p is prime, gcd(m, p) = 1 and omega(m) = k - 1, are all terms. In particular, this sequence includes numbers of the form p^4*q, where p != q are primes (A178739), and numbers of the form p^8*q*r where p, q, and r are distinct primes (A179747).
The corresponding numbers of squarefree (or powerful) divisors are 1, 2, 2, 2, 4, 4, 2, 4, 4, 4, 2, 4, ... . The least term with 2^k squarefree divisors is A360903(k).

Examples

			4 is a term since it has 2 squarefree divisors (1 and 2) and 2 powerful divisors (1 and 4).
36 is a term since it has 4 squarefree divisors (1, 2, 3 and 6) and 4 powerful divisors (1, 4, 9 and 36).
		

Crossrefs

Programs

  • Mathematica
    q[n_] := Module[{e = FactorInteger[n][[;; , 2]]}, Times @@ e == 2^Length[e]]; q[1] = True; Select[Range[1300], q]
  • PARI
    is(k) = {my(e = factor(k)[,2]); prod(i = 1, #e, e[i]) == 2^#e; }

A190466 Numbers with prime factorization pq^2r^7.

Original entry on oeis.org

5760, 8064, 9600, 12672, 14976, 18816, 19584, 21888, 22400, 26496, 31360, 33408, 35200, 35712, 41600, 42624, 43740, 46464, 47232, 49536, 54144, 54400, 60800, 61056, 61236, 64896, 67968, 68992, 70272, 73600, 77184, 77440, 81536, 81792
Offset: 1

Views

Author

Keywords

Crossrefs

Programs

  • Mathematica
    f[n_]:=Sort[Last/@FactorInteger[n]]=={1,2,7}; Select[Range[150000],f]
  • PARI
    list(lim)=my(v=List(),t1,t2);forprime(p=2, (lim\12)^(1/7), t1=p^7;forprime(q=2, sqrt(lim\t1), if(p==q, next);t2=t1*q^2;forprime(r=2, lim\t2, if(p==r||q==r, next);listput(v,t2*r)))); vecsort(Vec(v)) \\ Charles R Greathouse IV, Jul 24 2011

A190467 Numbers with prime factorization pq^3r^6.

Original entry on oeis.org

8640, 12096, 19008, 22464, 24000, 29160, 29376, 32832, 39744, 40824, 50112, 53568, 56000, 63936, 64152, 65856, 70848, 74304, 75816, 81216, 88000, 91584, 99144, 101952, 104000, 105408, 109760, 110808, 115776, 122688, 126144, 134136, 136000
Offset: 1

Views

Author

Keywords

Crossrefs

Programs

  • Mathematica
    f[n_]:=Sort[Last/@FactorInteger[n]]=={1,3,6}; Select[Range[200000],f]
  • PARI
    list(lim)=my(v=List(),t1,t2);forprime(p=2, (lim\24)^(1/6), t1=p^6;forprime(q=2, (lim\t1)^(1/3), if(p==q, next);t2=t1*q^3;forprime(r=2, lim\t2, if(p==r||q==r, next);listput(v,t2*r)))); vecsort(Vec(v)) \\ Charles R Greathouse IV, Jul 24 2011

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

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-5 of 5 results.