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

A101296 n has the a(n)-th distinct prime signature.

Original entry on oeis.org

1, 2, 2, 3, 2, 4, 2, 5, 3, 4, 2, 6, 2, 4, 4, 7, 2, 6, 2, 6, 4, 4, 2, 8, 3, 4, 5, 6, 2, 9, 2, 10, 4, 4, 4, 11, 2, 4, 4, 8, 2, 9, 2, 6, 6, 4, 2, 12, 3, 6, 4, 6, 2, 8, 4, 8, 4, 4, 2, 13, 2, 4, 6, 14, 4, 9, 2, 6, 4, 9, 2, 15, 2, 4, 6, 6, 4, 9, 2, 12, 7, 4, 2, 13, 4, 4, 4, 8, 2, 13, 4, 6, 4, 4, 4, 16, 2, 6, 6, 11, 2, 9, 2, 8, 9, 4, 2, 15, 2, 9, 4, 12, 2, 9, 4, 6, 6, 4, 4, 17
Offset: 1

Views

Author

David Wasserman, Dec 21 2004

Keywords

Comments

From Antti Karttunen, May 12 2017: (Start)
Restricted growth sequence transform of A046523, the least representative of each prime signature. Thus this partitions the natural numbers to the same equivalence classes as A046523, i.e., for all i, j: a(i) = a(j) <=> A046523(i) = A046523(j), and for that reason satisfies in that respect all the same conditions as A046523. For example, we have, for all i, j: if a(i) = a(j), then:
A000005(i) = A000005(j), A008683(i) = A008683(j), A286605(i) = A286605(j).
So, this sequence (instead of A046523) can be used for finding sequences where a(n)'s value is dependent only on the prime signature of n, that is, only on the multiset of prime exponents in the factorization of n. (End)
This is also the restricted growth sequence transform of many other sequences, for example, that of A181819. See further comments there. - Antti Karttunen, Apr 30 2022

Examples

			From _David A. Corneth_, May 12 2017: (Start)
1 has prime signature (), the first distinct prime signature. Therefore, a(1) = 1.
2 has prime signature (1), the second distinct prime signature after (1). Therefore, a(2) = 2.
3 has prime signature (1), as does 2. Therefore, a(3) = a(2) = 2.
4 has prime signature (2), the third distinct prime signature after () and (1). Therefore, a(4) = 3. (End)
From _Antti Karttunen_, May 12 2017: (Start)
Construction of restricted growth sequences: In this case we start with a(1) = 1 for A046523(1) = 1, and thereafter, for all n > 1, we use the least so far unused natural number k for a(n) if A046523(n) has not been encountered before, otherwise [whenever A046523(n) = A046523(m), for some m < n], we set a(n) = a(m).
For n = 2, A046523(2) = 2, which has not been encountered before (first prime), thus we allot for a(2) the least so far unused number, which is 2, thus a(2) = 2.
For n = 3, A046523(2) = 2, which was already encountered as A046523(1), thus we set a(3) = a(2) = 2.
For n = 4, A046523(4) = 4, not encountered before (first square of prime), thus we allot for a(4) the least so far unused number, which is 3, thus a(4) = 3.
For n = 5, A046523(5) = 2, as for the first time encountered at n = 2, thus we set a(5) = a(2) = 2.
For n = 6, A046523(6) = 6, not encountered before (first semiprime pq with distinct p and q), thus we allot for a(6) the least so far unused number, which is 4, thus a(6) = 4.
For n = 8, A046523(8) = 8, not encountered before (first cube of a prime), thus we allot for a(8) the least so far unused number, which is 5, thus a(8) = 5.
For n = 9, A046523(9) = 4, as for the first time encountered at n = 4, thus a(9) = 3.
(End)
From _David A. Corneth_, May 12 2017: (Start)
(Rough) description of an algorithm of computing the sequence:
Suppose we want to compute a(n) for n in [1..20].
We set up a vector of 20 elements, values 0, and a number m = 1, the minimum number we haven't checked and c = 0, the number of distinct prime signatures we've found so far.
[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
We check the prime signature of m and see that it's (). We increase c with 1 and set all elements up to 20 with prime signature () to 1. In the process, we adjust m. This gives:
[1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. The least number we haven't checked is m = 2. 2 has prime signature (1). We increase c with 1 and set all elements up to 20 with prime signature (1) to 2. In the process, we adjust m. This gives:
[1, 2, 2, 0, 2, 0, 2, 0, 0, 0, 2, 0, 2, 0, 0, 0, 2, 0, 2, 0]
We check the prime signature of m = 4 and see that its prime signature is (2). We increase c with 1 and set all numbers up to 20 with prime signature (2) to 3. This gives:
[1, 2, 2, 3, 2, 0, 2, 0, 3, 0, 2, 0, 2, 0, 0, 0, 2, 0, 2, 0]
Similarily, after m = 6, we get
[1, 2, 2, 3, 2, 4, 2, 0, 3, 4, 2, 0, 2, 4, 4, 0, 2, 0, 2, 0], after m = 8 we get:
[1, 2, 2, 3, 2, 4, 2, 5, 3, 4, 2, 0, 2, 4, 4, 0, 2, 0, 2, 0], after m = 12 we get:
[1, 2, 2, 3, 2, 4, 2, 5, 3, 4, 2, 6, 2, 4, 4, 0, 2, 6, 2, 0], after m = 16 we get:
[1, 2, 2, 3, 2, 4, 2, 5, 3, 4, 2, 6, 2, 4, 4, 7, 2, 6, 2, 0], after m = 20 we get:
[1, 2, 2, 3, 2, 4, 2, 5, 3, 4, 2, 6, 2, 4, 4, 7, 2, 6, 2, 8]. Now, m > 20 so we stop. (End)
The above method is inefficient, because the step "set all elements a(n) up to n = Nmax with prime signature s(n) = S[c] to c" requires factoring all integers up to Nmax (or at least comparing their signature, once computed, with S[c]) again and again. It is much more efficient to run only once over each m = 1..Nmax, compute its prime signature s(m), add it to an ordered list in case it did not occur earlier, together with its "rank" (= new size of the list), and assign that rank to a(m). The list of prime signatures is much shorter than [1..Nmax]. One can also use m'(m) := the smallest n with the prime signature of m (which is faster to compute than to search for the signature) as representative for s(m), and set a(m) := a(m'(m)). Then it is sufficient to have just one counter (number of prime signatures seen so far) as auxiliary variable, in addition to the sequence to be computed. - _M. F. Hasler_, Jul 18 2019

Links

Crossrefs

Cf. A025487, A046523, A064839 (ordinal transform of this sequence), A181819, and arrays A095904, A179216.
Cf. A000005, A008683.
Sequences that are unions of finite number (>= 2) of equivalence classes determined by the values that this sequence obtains (i.e., sequences mentioned in David A. Corneth's May 12 2017 formula): A001358 (A001248 U A006881, values 3 & 4), A007422 (values 1, 4, 5), A007964 (2, 3, 4, 5), A014612 (5, 6, 9), A030513 (4, 5), A037143 (1, 2, 3, 4), A037144 (1, 2, 3, 4, 5, 6, 9), A080258 (6, 7), A084116 (2, 4, 5), A167171 (2, 4), A217856 (6, 9).
Cf. also A077462, A305897 (stricter variants, with finer partitioning) and A254524, A286603, A286605, A286610, A286619, A286621, A286622, A286626, A286378 for other similarly constructed sequences.

Programs

  • Maple
    A101296 := proc(n)
    local a046523, a;
    a046523 := A046523(n) ;
    for a from 1 do
        if A025487(a) = a046523 then
            return a;
        elif A025487(a) > a046523 then
            return -1 ;
        end if;
    end do:
end proc: # R. J. Mathar, May 26 2017
  • Mathematica
    With[{nn = 120}, Function[s, Table[Position[Keys@s, k_ /; MemberQ[k, n]][[1, 1]], {n, nn}]]@ Map[#1 -> #2 & @@ # &, Transpose@ {Values@ #, Keys@ #}] &@ PositionIndex@ Table[Times @@ MapIndexed[Prime[First@ #2]^#1 &, Sort[FactorInteger[n][[All, -1]], Greater]] - Boole[n == 1], {n, nn}] ] (* Michael De Vlieger, May 12 2017, Version 10 *)
  • PARI
    find(ps, vps) = {for (k=1, #vps, if (vps[k] == ps, return(k)););}
lisps(nn) = {vps = []; for (n=1, nn, ps = vecsort(factor(n)[,2]); ips = find(ps, vps); if (! ips, vps = concat(vps, ps); ips = #vps); print1(ips, ", "););} \\ Michel Marcus, Nov 15 2015; edited by M. F. Hasler, Jul 16 2019
  • PARI
    rgs_transform(invec) = { my(occurrences = Map(), outvec = vector(length(invec)), u=1); for(i=1, length(invec), if(mapisdefined(occurrences,invec[i]), my(pp = mapget(occurrences, invec[i])); outvec[i] = outvec[pp] , mapput(occurrences,invec[i],i); outvec[i] = u; u++ )); outvec; };
write_to_bfile(start_offset,vec,bfilename) = { for(n=1, length(vec), write(bfilename, (n+start_offset)-1, " ", vec[n])); }
write_to_bfile(1,rgs_transform(vector(100000,n,A046523(n))),"b101296.txt");
\\ Antti Karttunen, May 12 2017

Formula

A025487(a(n)) = A046523(n).
Indices of records give A025487. - Michel Marcus, Nov 16 2015
From David A. Corneth, May 12 2017: (Start) [Corresponding characteristic function in brackets]
a(A000012(n)) = 1 (sig.: ()). [A063524]
a(A000040(n)) = 2 (sig.: (1)). [A010051]
a(A001248(n)) = 3 (sig.: (2)). [A302048]
a(A006881(n)) = 4 (sig.: (1,1)). [A280710]
a(A030078(n)) = 5 (sig.: (3)).
a(A054753(n)) = 6 (sig.: (1,2)). [A353472]
a(A030514(n)) = 7 (sig.: (4)).
a(A065036(n)) = 8 (sig.: (1,3)).
a(A007304(n)) = 9 (sig.: (1,1,1)). [A354926]
a(A050997(n)) = 10 (sig.: (5)).
a(A085986(n)) = 11 (sig.: (2,2)).
a(A178739(n)) = 12 (sig.: (1,4)).
a(A085987(n)) = 13 (sig.: (1,1,2)).
a(A030516(n)) = 14 (sig.: (6)).
a(A143610(n)) = 15 (sig.: (2,3)).
a(A178740(n)) = 16 (sig.: (1,5)).
a(A189975(n)) = 17 (sig.: (1,1,3)).
a(A092759(n)) = 18 (sig.: (7)).
a(A189988(n)) = 19 (sig.: (2,4)).
a(A179643(n)) = 20 (sig.: (1,2,2)).
a(A189987(n)) = 21 (sig.: (1,6)).
a(A046386(n)) = 22 (sig.: (1,1,1,1)).
a(A162142(n)) = 23 (sig.: (2,2,2)).
a(A179644(n)) = 24 (sig.: (1,1,4)).
a(A179645(n)) = 25 (sig.: (8)).
a(A179646(n)) = 26 (sig.: (2,5)).
a(A163569(n)) = 27 (sig.: (1,2,3)).
a(A179664(n)) = 28 (sig.: (1,7)).
a(A189982(n)) = 29 (sig.: (1,1,1,2)).
a(A179666(n)) = 30 (sig.: (3,4)).
a(A179667(n)) = 31 (sig.: (1,1,5)).
a(A179665(n)) = 32 (sig.: (9)).
a(A189990(n)) = 33 (sig.: (2,6)).
a(A179669(n)) = 34 (sig.: (1,2,4)).
a(A179668(n)) = 35 (sig.: (1,8)).
a(A179670(n)) = 36 (sig.: (1,1,1,3)).
a(A179671(n)) = 37 (sig.: (3,5)).
a(A162143(n)) = 38 (sig.: (2,2,2)).
a(A179672(n)) = 39 (sig.: (1,1,6)).
a(A030629(n)) = 40 (sig.: (10)).
a(A179688(n)) = 41 (sig.: (1,3,3)).
a(A179689(n)) = 42 (sig.: (2,7)).
a(A179690(n)) = 43 (sig.: (1,1,2,2)).
a(A189991(n)) = 44 (sig.: (4,4)).
a(A179691(n)) = 45 (sig.: (1,2,5)).
a(A179692(n)) = 46 (sig.: (1,9)).
a(A179693(n)) = 47 (sig.: (1,1,1,4)).
a(A179694(n)) = 48 (sig.: (3,6)).
a(A179695(n)) = 49 (sig.: (2,2,3)).
a(A179696(n)) = 50 (sig.: (1,1,7)).
(End)

Extensions

Data section extended to 120 terms by Antti Karttunen, May 12 2017
Minor edits/corrections by M. F. Hasler, Jul 18 2019

A189982 Numbers with prime signature (2,1,1,1), i.e., factorization p*q*r*s^2 with distinct primes p, q, r, s.

Original entry on oeis.org

420, 630, 660, 780, 924, 990, 1020, 1050, 1092, 1140, 1170, 1380, 1386, 1428, 1470, 1530, 1540, 1596, 1638, 1650, 1710, 1716, 1740, 1820, 1860, 1932, 1950, 2070, 2142, 2220, 2244, 2380, 2394, 2436, 2460, 2508, 2550, 2574, 2580, 2604, 2610, 2652, 2660, 2790
Offset: 1

Views

Author

Vladimir Joseph Stephan Orlovsky, May 03 2011

Keywords

Comments

Theorem 4 in Goldston-Graham-Pintz-Yildirim proves that a(n+1) = a(n) + 1 for infinitely many n. - Charles R Greathouse IV, Jul 17 2015, corrected by M. F. Hasler, Jul 17 2019

Links

Crossrefs

Part of the list A178739 .. A179696 and A030514 .. A030629, A189975 .. A189990 etc., cf. A101296.

Programs

  • Mathematica
    f[n_]:=Sort[Last/@FactorInteger[n]]=={1,1,1,2}; Select[Range[4000],f]
  • PARI
    is(n)=vecsort(factor(n)[,2])==[1, 1, 1, 2]~ \\ Charles R Greathouse IV, Jul 17 2015

Extensions

Definition reworded by M. F. Hasler, Jul 17 2019

A137484 Numbers with 21 divisors.

Original entry on oeis.org

576, 1600, 2916, 3136, 7744, 10816, 18225, 18496, 23104, 33856, 35721, 53824, 61504, 62500, 87616, 88209, 107584, 118336, 123201, 140625, 141376, 179776, 210681, 222784, 238144, 263169, 287296, 322624, 341056, 385641, 399424, 440896
Offset: 1

Views

Author

R. J. Mathar, Apr 22 2008

Keywords

Comments

Maple implementation: see A030513.
Numbers of the form p^20 or p^2*q^6 (A189990) where p and q are distinct primes. - R. J. Mathar, Mar 01 2010

Links

Crossrefs

Cf. A000005, A030513, A030638 (20 divisors), A137485 (22 divisors), A189990.

Programs

  • Mathematica
    Select[Range[450000],DivisorSigma[0,#]==21&] (* Vladimir Joseph Stephan Orlovsky, May 03 2011 *)
  • PARI
    is(n)=numdiv(n)==21 \\ Charles R Greathouse IV, Jun 19 2016
  • Python
    from math import isqrt
from sympy import primepi, primerange, integer_nthroot
def A137484(n):
    def bisection(f,kmin=0,kmax=1):
        while f(kmax) > kmax: kmax <<= 1
        kmin = kmax >> 1
        while kmax-kmin > 1:
            kmid = kmax+kmin>>1
            if f(kmid) <= kmid:
                kmax = kmid
            else:
                kmin = kmid
        return kmax
    def f(x): return n+x-sum(primepi(isqrt(x//p**6)) for p in primerange(integer_nthroot(x,6)[0]+1))+primepi(integer_nthroot(x,8)[0])-primepi(integer_nthroot(x,20)[0])
    return bisection(f,n,n) # Chai Wah Wu, Feb 21 2025

Formula

A000005(a(n)) = 21.
Sum_{n>=1} 1/a(n) = P(2)*P(6) - P(8) + P(20) = 0.00365945..., where P is the prime zeta function. - Amiram Eldar, Jul 03 2022

A179690 Numbers of the form p^2*q^2*r*s where p, q, r, and s are distinct primes.

Original entry on oeis.org

1260, 1980, 2100, 2340, 2772, 2940, 3060, 3150, 3276, 3300, 3420, 3900, 4140, 4284, 4410, 4788, 4950, 5100, 5148, 5220, 5580, 5700, 5796, 5850, 6468, 6660, 6732, 6900, 7260, 7308, 7350, 7380, 7524, 7644, 7650, 7700, 7740, 7812, 7956, 8460, 8550, 8700
Offset: 1

Views

Author

Vladimir Joseph Stephan Orlovsky, Jul 24 2010

Keywords

Links

Crossrefs

Part of the list A178739 .. A179696 and A030514 .. A030629, A189975 .. A189990 etc., cf. A101296. - M. F. Hasler, Jul 17 2019

Programs

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

A179691 Numbers p^5*q^2*r where p, q, r are 3 distinct primes.

Original entry on oeis.org

1440, 2016, 2400, 3168, 3744, 4704, 4860, 4896, 5472, 5600, 6624, 6804, 7840, 8352, 8800, 8928, 10400, 10656, 10692, 11616, 11808, 12150, 12384, 12636, 13536, 13600, 15200, 15264, 16224, 16524, 16992, 17248, 17568, 18400, 18468, 19296, 19360
Offset: 1

Views

Author

Vladimir Joseph Stephan Orlovsky, Jul 24 2010

Keywords

Links

Crossrefs

Part of the list A178739 .. A179696 (and A030514 .. A030629, A189982 .. A189990 etc, cf. A101296). - M. F. Hasler, Jul 17 2019
Subsequence of A175746 (numbers with 36 divisors).

Programs

  • Mathematica
    f[n_]:=Sort[Last/@FactorInteger[n]]=={1,2,5}; Select[Range[20000], f]
  • PARI
    list(lim)=my(v=List(),t1,t2);forprime(p=2, (lim\12)^(1/5), t1=p^5;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
  • Python
    from math import isqrt
from sympy import primepi, primerange, integer_nthroot
def A179691(n):
    def bisection(f,kmin=0,kmax=1):
        while f(kmax) > kmax: kmax <<= 1
        kmin = kmax >> 1
        while kmax-kmin > 1:
            kmid = kmax+kmin>>1
            if f(kmid) <= kmid:
                kmax = kmid
            else:
                kmin = kmid
        return kmax
    def f(x): return n+x-sum(primepi(x//(p**5*q**2)) for p in primerange(integer_nthroot(x,5)[0]+1) for q in primerange(isqrt(x//p**5)+1))+sum(primepi(integer_nthroot(x//p**5,3)[0]) for p in primerange(integer_nthroot(x,5)[0]+1))+sum(primepi(isqrt(x//p**6)) for p in primerange(integer_nthroot(x,6)[0]+1))+sum(primepi(x//p**7) for p in primerange(integer_nthroot(x,7)[0]+1))-(primepi(integer_nthroot(x,8)[0])<<1)
    return bisection(f,n,n) # Chai Wah Wu, Mar 27 2025

Extensions

Name improved by M. F. Hasler, Jul 17 2019

A189991 Numbers with prime factorization p^4*q^4.

Original entry on oeis.org

1296, 10000, 38416, 50625, 194481, 234256, 456976, 1185921, 1336336, 1500625, 2085136, 2313441, 4477456, 6765201, 9150625, 10556001, 11316496, 14776336, 17850625, 22667121, 29986576, 35153041, 45212176, 52200625, 54700816, 57289761, 68574961, 74805201
Offset: 1

Views

Author

Vladimir Joseph Stephan Orlovsky, May 03 2011

Keywords

Comments

The primes p and q must be distinct, or else the product has factorization p^8 (or q^8, for that matter).

Links

Crossrefs

Cf. A006881, A137488, A179671, A189990.
Cf. A085964, A085968, A085986.

Programs

  • Mathematica
    lst = {}; Do[If[Sort[Last/@FactorInteger[n]] == {4, 4}, Print[n]; AppendTo[lst, n]], {n,55000000}]; lst (* Orlovsky *)
lim = 10^8; pMax = PrimePi[(lim/16)^(1/4)]; Select[Union[Flatten[Table[Prime[i]^4 Prime[j]^4, {i, 2, pMax}, {j, i - 1}]]], # <= lim &] (* Alonso del Arte, May 03 2011 *)
With[{nn=30},Take[Union[Times@@@(Subsets[Prime[Range[nn]],{2}]^4)],nn]] (* Harvey P. Dale, Mar 05 2015 *)
  • PARI
    list(lim)=my(v=List(),t);forprime(p=2, lim^(1/8), t=p^4;forprime(q=p+1, (lim\t)^(1/4), listput(v,t*q^4))); vecsort(Vec(v)) \\ Charles R Greathouse IV, Jul 24 2011
  • Python
    from math import isqrt
from sympy import primepi, integer_nthroot, primerange
def A189991(n):
    def bisection(f,kmin=0,kmax=1):
        while f(kmax) > kmax: kmax <<= 1
        kmin = kmax >> 1
        while kmax-kmin > 1:
            kmid = kmax+kmin>>1
            if f(kmid) <= kmid:
                kmax = kmid
            else:
                kmin = kmid
        return kmax
    def f(x): return int(n+x+(t:=primepi(s:=isqrt(y:=integer_nthroot(x,4)[0])))+(t*(t-1)>>1)-sum(primepi(y//k) for k in primerange(1, s+1)))
    return bisection(f,n,n) # Chai Wah Wu, Feb 22 2025

Formula

Sum_{n>=1} 1/a(n) = (P(4)^2 - P(8))/2 = (A085964^2 - A085968)/2 = 0.000933..., where P is the prime zeta function. - Amiram Eldar, Jul 06 2020
a(n) = A006881(n)^4 = A085986(n)^2. - Chai Wah Wu, Mar 27 2025

A190111 Numbers with prime factorization p*q*r*s^2*t^3 (where p, q, r, s, t are distinct primes).

Original entry on oeis.org

27720, 32760, 41580, 42840, 46200, 47880, 49140, 51480, 54600, 57960, 64260, 64680, 67320, 71400, 71820, 72072, 73080, 75240, 76440, 77220, 78120, 79560, 79800, 85800, 86940, 88920, 91080, 93240, 94248, 96600, 99960, 100980, 101640, 103320
Offset: 1

Views

Author

Vladimir Joseph Stephan Orlovsky, May 04 2011

Keywords

Examples

			From _Petros Hadjicostas_, Oct 26 2019: (Start)
a(1) = (2^3)*(3^2)*5*7*11 = 27720;
a(2) = (2^3)*(3^2)*5*7*13 = 32760;
a(3) = (2^2)*(3^3)*5*7*11 = 41580;
a(4) = (2^3)*(3^2)*5*7*17 = 42840;
a(5) = (2^3)*3*(5^2)*7*11 = 46200.
(End)

Links

Crossrefs

Cf. A179645, A189990, A190109, A190110.

Programs

  • Mathematica
    f[n_]:=Sort[Last/@FactorInteger[n]]=={1,1,1,2,3};Select[Range[150000],f]
  • PARI
    list(lim)=my(v=List(),t1,t2,t3,t4); forprime(p=2,sqrtnint(lim\420, 3), t1=p^3; forprime(q=2,sqrtint(lim\(30*t1)), if(q==p, next); t2=q^2*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

A382292 Numbers k such that A382290(k) = 1.

Original entry on oeis.org

8, 24, 27, 32, 40, 54, 56, 64, 72, 88, 96, 104, 108, 120, 125, 135, 136, 152, 160, 168, 184, 189, 192, 200, 224, 232, 243, 248, 250, 264, 270, 280, 288, 296, 297, 312, 320, 328, 343, 344, 351, 352, 360, 375, 376, 378, 392, 408, 416, 424, 432, 440, 448, 456, 459, 472, 480, 486, 488, 500
Offset: 1

Views

Author

Amiram Eldar, Mar 21 2025

Keywords

Comments

First differs from A374590 and A375432 at n = 25: A374590(25) = A375432(25) = 216 is not a term of this sequence.
Numbers k such that A382291(k) = 2, i.e., numbers whose number of infinitary divisors is twice the number of their unitary divisors.
Numbers whose prime factorization has a single exponent that is a sum of two distinct powers of 2 (A018900) and all the other exponents, if they exist, are powers of 2. Equivalently, numbers of the form p^e * m, where p is a prime, e is a term in A018900, and m is a term in A138302 that is coprime to p.
If k is a term then k^2 is also a term. If m is a term in A138302 that is coprime to k then k * m is also a term. The primitive terms, i.e., the terms that cannot be generated from smaller terms using these rules, are the numbers of the form p^(2^i+1), where p is prime and i >= 1.
Analogous to A060687, which is the sequence of numbers k with prime excess A046660(k) = 2.
The asymptotic density of this sequence is A271727 * Sum_{p prime} (((1 - 1/p)/f(1/p)) * Sum_{k>=1} 1/p^A018900(k)) = 0.11919967112489084407..., where f(x) = 1 - x^3 + Sum_{k>=2} (x^(2^k)-x^(2^k+1)).

Links

Crossrefs

Cf. A018900, A046660, A060687, A271727, A374590, A375432, A382290, A382291.
Subsequences (numbers of the form): A030078 (p^3), A050997 (p^5), A030516 (p^6), A179665 (p^9), A030629 (p^10), A030631 (p^12), A065036 (p^3*q), A178740 (p^5*q), A189987 (p^6*q), A179692 (p^9*q), A143610 (p^2*q^3), A179646 (p^5*q^2), A189990 (p^2*q^6), A179702 (p^4*q^5), A179666 (p^4*q^3), A190464 (p^4*q^6), A163569 (p^3*q^2*r), A189975 (p*q*r^3), A190115 (p^2*q^3*r^4), A381315, A048109.

Programs

  • Mathematica
    f[p_, e_] := DigitCount[e, 2, 1] - 1; q[1] = False; q[n_] := Plus @@ f @@@ FactorInteger[n] == 1; Select[Range[500], q]
  • PARI
    isok(k) = vecsum(apply(x -> hammingweight(x) - 1, factor(k)[, 2])) == 1;

A355462 Powerful numbers divisible by exactly 2 distinct primes.

Original entry on oeis.org

36, 72, 100, 108, 144, 196, 200, 216, 225, 288, 324, 392, 400, 432, 441, 484, 500, 576, 648, 675, 676, 784, 800, 864, 968, 972, 1000, 1089, 1125, 1152, 1156, 1225, 1296, 1323, 1352, 1372, 1444, 1521, 1568, 1600, 1728, 1936, 1944, 2000, 2025, 2116, 2304, 2312, 2500
Offset: 1

Views

Author

Amiram Eldar, Jul 03 2022

Keywords

Comments

First differs from A286708 at n = 25.
Number of the form p^i * q^j, where p != q are primes and i,j > 1.
Numbers k such that A001221(k) = 2 and A051904(k) >= 2.
The possible values of the number of the divisors (A000005) of terms in this sequence is any composite number that is not 8 or twice a prime (A264828 \ {1, 8}).
675 = 3^3*5^2 and 676 = 2^2*13^2 are 2 consecutive integers in this sequence. There are no other such pairs below 10^22 (the lesser members of such pairs are terms of A060355).

Examples

			36 is a term since 36 = 2^2 * 3^2.

Links

Crossrefs

Intersection of A001694 and A007774.
Subsequence of A286708.
Subsequences: A085986, A143610, A162142, A179646, A179666, A179671, A179689, A179694, A179699, A179702, A179705, A189988, A189990, A189991, A190464, A190465, A303661.
Cf. A000005, A001221, A051904, A060355, A136141, A264828.

Programs

  • Mathematica
    Select[Range[2500], Length[(e = FactorInteger[#][[;; , 2]])] == 2 && Min[e] > 1 &]
  • PARI
    is(n) = {my(f=factor(n)); #f~ == 2 && vecmin(f[,2]) > 1};

Formula

Sum_{n>=1} 1/a(n) = ((Sum_{p prime} (1/(p*(p-1))))^2 - Sum_{p prime} (1/(p^2*(p-1)^2)))/2 = 0.1583860791... .

A381314 Powerful numbers that have a single exponent in their prime factorization that equals 2.

Original entry on oeis.org

4, 9, 25, 49, 72, 108, 121, 144, 169, 200, 288, 289, 324, 361, 392, 400, 500, 529, 576, 675, 784, 800, 841, 961, 968, 972, 1125, 1152, 1323, 1352, 1369, 1372, 1568, 1600, 1681, 1849, 1936, 2025, 2209, 2304, 2312, 2500, 2704, 2809, 2888, 2916, 3087, 3136, 3200
Offset: 1

Views

Author

Amiram Eldar, Feb 19 2025

Keywords

Comments

Number of the form A036966(m)/p, m >= 2, where p is a prime divisor of A036966(m).

Links

Crossrefs

Subsequence of A001694, A377816 and A377818.
Subsequences: A001248, A143610, A179646, A179689, A179699, A189988, A189990, A190106, A190115, A190470, A190471.
Cf. A036966, A065483.

Programs

  • Mathematica
    With[{max = 3200}, Select[Union@ Flatten@ Table[i^2 * j^3, {j, 1, max^(1/3)}, {i, 1, Sqrt[max/j^3]}], Count[FactorInteger[#][[;; , 2]], 2] == 1 &]]
  • PARI
    isok(k) = if(k == 1, 0, my(e = factor(k)[, 2]); vecmin(e) > 1 && #select(x -> (x==2), e) == 1);

Formula

Sum_{n>=1} 1/a(n) = Sum_{p prime}((p-1)/(p^3-p^2+1)) * Product_{p prime} (1 + 1/(p^2*(p-1))) = 0.53045141423939736076... .
Showing 1-10 of 10 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.