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.

A190384 Numbers with prime factorization pqrs^2t^4.

Original entry on oeis.org

55440, 65520, 85680, 92400, 95760, 102960, 109200, 115920, 124740, 129360, 134640, 142800, 144144, 146160, 147420, 150480, 152880, 156240, 159120, 159600, 171600, 177840, 182160, 186480, 188496, 192780, 193200, 199920, 203280, 206640
Offset: 1

Views

Author

Vladimir Joseph Stephan Orlovsky, May 09 2011

Keywords

Links

Crossrefs

Cf. A190382, A190383.

Programs

  • Mathematica
    f[n_]:=Sort[Last/@FactorInteger[n]]=={1,1,1,2,4};Select[Range[300000],f]
  • PARI
    list(lim)=my(v=List(),t1,t2,t3,t4); forprime(p1=2,sqrtnint(lim\420, 4), t1=p1^4; forprime(p2=2,sqrtint(lim\(30*t1)), if(p2==p1, next); t2=p2^2*t1; forprime(p3=2,lim\(6*t2), if(p3==p1 || p3==p2, next); t3=p3*t2; forprime(p4=2,lim\(2*t3), if(p4==p1 || p4==p2 || p4==p3, next); t4=p4*t3; forprime(p5=2,lim\t4, if(p5==p1 || p5==p2 || p5==p3 || p5==p4, next); listput(v, t4*p5)))))); Set(v) \\ Charles R Greathouse IV, Aug 25 2016

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...

Links

Crossrefs

Complement of A381311 within A190641.
Cf. A057521, A118914.
Subsequence of A268335, A301517 and A374459.
Subsequences: A030078, A050997, A056824, A065036, A079395, A092759, A138031, A178740, A179664, A179665, A179667, A179670, A179692, A179696, A179704, A189975, A189984, A190378, A190383, A190473.

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

A190385 Numbers with prime factorization pqrs^3t^3.

Original entry on oeis.org

83160, 98280, 128520, 143640, 154440, 173880, 201960, 216216, 219240, 225720, 231000, 234360, 238680, 266760, 273000, 273240, 279720, 282744, 309960, 316008, 322920, 325080, 334152, 344520, 348840, 355320, 357000, 368280, 373464, 382536
Offset: 1

Views

Author

Vladimir Joseph Stephan Orlovsky, May 09 2011

Keywords

Links

Crossrefs

Cf. A190382, A190383, A190384.

Programs

  • Mathematica
    f[n_]:=Sort[Last/@FactorInteger[n]]=={1,1,1,3,3};Select[Range[600000],f]
  • PARI
    list(lim)=my(v=List(),t1,t2,t3,t4); forprime(p=2,sqrtnint(lim\840, 3), t1=p^3; forprime(q=2,sqrtnint(lim\(30*t1), 3), if(q==p, next); t2=q^3*t1; forprime(r=2,lim\(6*t2), if(r==p || r==q, next); t3=r*t2; forprime(s=2,lim\(2*t3), if(s==p || s==q || s==r, next); t4=s*t3; forprime(t=2,lim\t4, if(t==p || t==q || t==r || t==s, next); listput(v, t4*t)))))); Set(v) \\ Charles R Greathouse IV, Aug 25 2016

A190386 Numbers with prime factorization pqr^2s^2t^3.

Original entry on oeis.org

138600, 163800, 194040, 207900, 214200, 229320, 239400, 245700, 257400, 289800, 291060, 299880, 304920, 321300, 323400, 335160, 336600, 343980, 346500, 359100, 365400, 376200, 382200, 386100, 390600, 397800, 405720, 409500, 425880, 434700
Offset: 1

Views

Author

Vladimir Joseph Stephan Orlovsky, May 09 2011

Keywords

Links

Crossrefs

Cf. A190383, A190384, A190385.

Programs

  • Mathematica
    f[n_]:=Sort[Last/@FactorInteger[n]]=={1,1,2,2,3};Select[Range[600000],f]
  • PARI
    list(lim)=my(v=List(),t1,t2,t3,t4); forprime(p=2,sqrtnint(lim\1260, 3), t1=p^3; forprime(q=2,sqrtint(lim\(60*t1)), if(q==p, next); t2=q^2*t1; forprime(r=2,sqrtint(lim\(6*t2)), if(r==p || r==q, next); t3=r^2*t2; forprime(s=2,lim\(2*t3), if(s==p || s==q || s==r, next); t4=s*t3; forprime(t=2,lim\t4, if(t==p || t==q || t==r || t==s, next); listput(v, t4*t)))))); Set(v) \\ Charles R Greathouse IV, Aug 25 2016

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... .

Links

Crossrefs

Complement of A060687 within A190641.
Cf. A013661, A057521, A246549, A369632.
Cf. A344653, A345193.
Subsequences: A030078, A030514, A030516, A030629, A030631, A050997, A056824, A065036, A079395, A092759, A138031, A178739, A178740, A179644, A179645, A179664, A179665, A179667, A179668, A179670, A179672, A179692, A179693, A179696, A179704, A179747, A189975, A189984, A189987, A190110, A190292, A190378, A190383, A190388, A190473, A381312.

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.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.