A030078 -id:A030078 - cp's OEIS frontend

A168363 Squares and cubes of primes.

4, 8, 9, 25, 27, 49, 121, 125, 169, 289, 343, 361, 529, 841, 961, 1331, 1369, 1681, 1849, 2197, 2209, 2809, 3481, 3721, 4489, 4913, 5041, 5329, 6241, 6859, 6889, 7921, 9409, 10201, 10609, 11449, 11881, 12167, 12769, 16129, 17161, 18769, 19321, 22201

Offset: 1

Franklin T. Adams-Watters, Nov 23 2009

nonn

Primitive elements for powerful numbers; every powerful is product of these numbers. The representation is not necessarily unique.

Cf. A001694, A053810, A001248, A030078, A087797, A178254.

m=30000;Union[Prime[Range[PrimePi[m^(1/2)]]]^2,Prime[Range[PrimePi[m^(1/3)]]]^3] (* Vladimir Joseph Stephan Orlovsky, Apr 11 2011 *)
With[{nn=50},Take[Union[Flatten[Table[{n^2,n^3},{n,Prime[Range[ nn]]}]]],nn]] (* Harvey P. Dale, Feb 26 2015 *)

for(n=1,40000,fm=factor(n);if(matsize(fm)[1]==1&(fm[1,2]==2||fm[1,2]==3),print1(n",")))

is(n)=my(k=isprimepower(n)); k && k<4 \\ Charles R Greathouse IV, May 24 2013

from math import isqrt
from sympy import primepi, integer_nthroot
def A168363(n):
    def f(x): return n+x-primepi(isqrt(x))-primepi(integer_nthroot(x,3)[0])
    m, k = n, f(n)
    while m != k:
        m, k = k, f(k)
    return int(m) # Chai Wah Wu, Aug 09 2024

A178254(a(n)) = 2. - Reinhard Zumkeller, May 24 2010

Sum_{n>=1} 1/a(n) = P(2) + P(3) = 0.6270100593..., where P is the prime zeta function. - Amiram Eldar, Dec 21 2020

A182944 Square array A(i,j), i >= 1, j >= 1, of prime powers prime(i)^j, by descending antidiagonals.

Original entry on oeis.org

2, 4, 3, 8, 9, 5, 16, 27, 25, 7, 32, 81, 125, 49, 11, 64, 243, 625, 343, 121, 13, 128, 729, 3125, 2401, 1331, 169, 17, 256, 2187, 15625, 16807, 14641, 2197, 289, 19, 512, 6561, 78125, 117649, 161051, 28561, 4913, 361, 23

Offset: 1

Clark Kimberling, Dec 14 2010

We alternatively refer to this sequence as a triangle T(.,.), with T(n,k) = A(k,n-k+1) = prime(k)^(n-k+1).
The monotonic ordering of this sequence, prefixed by 1, is A000961.
The joint-rank array of this sequence is A182869.
Main diagonal gives A062457. - Omar E. Pol, Sep 11 2018

			Square array A(i,j) begins:
  i \ j: 1      2      3      4      5  ...
  ---\-------------------------------------
  1:     2,     4,     8,    16,    32, ...
  2:     3,     9,    27,    81,   243, ...
  3:     5,    25,   125,   625,  3125, ...
  4:     7,    49,   343,  2401, 16807, ...
  ...
The triangle T(n,k) begins:
  n\k:  1     2     3     4     5     6  ...
  1:    2
  2:    4     3
  3:    8     9     5
  4:   16    27    25     7
  5:   32    81   125    49    11
  6:   64   243   625   343   121    13
  ...

Michael De Vlieger, Table of n, a(n) for n = 1..11325 (rows 1..150, flattened)
Michael De Vlieger, Diagram showing row n of triangle in a semicircle as noted, with a color function associated with the magnitude of T(n,k) compared to 2^n in light blue, where prime(n) is the smallest and the prime power indicated in red the largest in the row.

Cf. A000961, A006939 (row products of triangle), A062457, A182945, A332979 (row maxima of triangle).
Columns: A000040 (1), A001248 (2), A030078 (3), A030514 (4), A050997 (5), A030516 (6), A092759 (7), A179645 (8), A179665 (9), A030629 (10).
A319075 extends the array with 0th powers.
Subtable of A242378, A284457, A329332.

TableForm[Table[Prime[n]^j,{n,1,14},{j,1,8}]]

From Peter Munn, Dec 29 2019: (Start)
A(i,j) = A182945(j,i) = A319075(j,i).
A(i,j) = A242378(i-1,2^j) = A329332(2^(i-1),j).
A(i,i) = A062457(i).
(End)

Clarified in respect of alternate reading as a triangle by Peter Munn, Aug 28 2022

A376936 Powerful numbers divisible by cubes of 2 distinct primes.

Original entry on oeis.org

216, 432, 648, 864, 1000, 1296, 1728, 1944, 2000, 2592, 2744, 3375, 3456, 3888, 4000, 5000, 5184, 5400, 5488, 5832, 6912, 7776, 8000, 9000, 9261, 10000, 10125, 10368, 10584, 10648, 10800, 10976, 11664, 13500, 13824, 15552, 16000, 16200, 16875, 17496, 17576, 18000

Offset: 1

Michael De Vlieger, Oct 16 2024

Numbers m with coreful divisors d, m/d such that neither d | m/d nor m/d | d, i.e., numbers m such that there exists a divisor pair (d, m/d) such that rad(d) = rad(m/d) but gcd(d, m/d) > 1 is neither d nor m/d, where rad = A007947. Divisors in each pair must be dissimilar and each in A126706.
Proper subset of A320966.
Contains A372695, A177493, and A162142. Does not contain A085986.

			216 is in the sequence since rad(12) | rad(18), but 12 does not divide 18 and 18 does not divide 12.
432 is a term since rad(18) | rad(24), but 18 does not divide 24 and 24 does not divide 18.
Table of coreful divisors d, a(n)/d such that neither d | a(n)/d nor a(n)/d | d for select a(n)
   n |   a(n)   divisor pairs d X a(n)/d
  ---------------------------------------------------------------------------
   1 |   216:   12 X 18;
   2 |   432:   18 X 24;
   3 |   648:   12 X 54;
   4 |   864:   24 X 36, 18 X 48;
   5 |  1000:   20 X 50;
   6 |  1296:   24 X 54;
   7 |  1728:   18 X 96, 36 X 48;
   8 |  1944:   12 X 162, 36 X 54;
   9 |  2000:   40 X 50;
  10 |  2592:   24 X 108, 48 X 54;
  11 |  2744:   28 X 98;
  12 |  3375:   45 X 75;
  13 |  3456:   18 X 192, 36 X 96, 48 X 72;
  22 |  7776:   24 X 324, 48 X 162, 54 X 144, 72 X 108;
  58 | 31104:   48 X 648, 54 X 576, 96 X 324, 108 X 288, 144 X 216, 162 X 192

Michael De Vlieger, Table of n, a(n) for n = 1..10000
Michael De Vlieger, Notes on this sequence

Cf. A007947, A030078, A085986, A126706, A162142, A177493, A286708, A307958, A320966, A361430, A370329, A372695, A376514.

Cf. A082020, A082695.

Union@ Select[
  Flatten@ Table[a^2*b^3, {b, Surd[#, 3]}, {a, Sqrt[#/b^3]}] &[20000],
  Length@ Select[FactorInteger[#][[All, -1]], # > 2 &] >= 2 &]

Sum_{n>=1} 1/a(n) = zeta(2)*zeta(3)/zeta(6) - (15/Pi^2) * (1 + Sum_{prime} 1/((p-1)*(p^2+1))) = 0.021194288968234037106579437374641326044... . - Amiram Eldar, Nov 08 2024

A133534 Sum of third powers of two consecutive primes.

Original entry on oeis.org

35, 152, 468, 1674, 3528, 7110, 11772, 19026, 36556, 54180, 80444, 119574, 148428, 183330, 252700, 354256, 432360, 527744, 658674, 746928, 882056, 1064826, 1276756, 1617642, 1942974, 2123028, 2317770, 2520072, 2737926, 3491280

Offset: 1

Artur Jasinski, Sep 14 2007

nonn

			a(1)=35 because 2^3+3^3=35.

Harvey P. Dale, Table of n, a(n) for n = 1..1000

Cf. A034963, A133524, A133525, A133526, A133527, A133528, A133529, A133530, A133531, A133532, A069484, A133535, A133536, A133537, A133538.

a = 3; Table[Prime[n]^a + Prime[n + 1]^a, {n, 1, 100}]
Total[#^3]&/@Partition[Prime[Range[50]],2,1] (* Harvey P. Dale, Jan 29 2021 *)

a(n) = A030078(n) + A030078(n+1). - Michel Marcus, Nov 09 2013

A291761 Restricted growth sequence transform of ((-1)^n)*A046523(n); filter combining the parity and the prime signature of n.

Original entry on oeis.org

1, 2, 3, 4, 3, 5, 3, 6, 7, 5, 3, 8, 3, 5, 9, 10, 3, 8, 3, 8, 9, 5, 3, 11, 7, 5, 12, 8, 3, 13, 3, 14, 9, 5, 9, 15, 3, 5, 9, 11, 3, 13, 3, 8, 16, 5, 3, 17, 7, 8, 9, 8, 3, 11, 9, 11, 9, 5, 3, 18, 3, 5, 16, 19, 9, 13, 3, 8, 9, 13, 3, 20, 3, 5, 16, 8, 9, 13, 3, 17, 21, 5, 3, 18, 9, 5, 9, 11, 3, 18, 9, 8, 9, 5, 9, 22, 3, 8, 16, 15, 3, 13, 3, 11, 23, 5, 3, 20, 3, 13

Offset: 1

Antti Karttunen, Sep 11 2017

nonn

Equally, restricted growth sequence transform of sequence b defined as b(1) = 1, and for n > 1, b(n) = A046523(n) + A000035(n), which starts as 1, 2, 3, 4, 3, 6, 3, 8, 5, 6, 3, 12, 3, 6, 7, 16, 3, 12, 3, 12, ...

Antti Karttunen, Table of n, a(n) for n = 1..65537

Cf. A291767, A291768 (bisections), A147516.
Cf. A046523, A101296, A286161, A286251, A286367, A291762 (related or similar filtering sequences).
Cf. A065091 (positions of 3's), A100484 (of 4 and 5's), A001248 (of 4 and 7's), A046388 (of 9's), A030078 (of 6 and 12's).
Cf. A098108 (one of the matching sequences).

rgs_transform(invec) = { my(om = Map(), outvec = vector(length(invec)), u=1); for(i=1, length(invec), if(mapisdefined(om,invec[i]), my(pp = mapget(om, invec[i])); outvec[i] = outvec[pp] , mapput(om,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])); }
A046523(n) = { my(f=vecsort(factor(n)[, 2], , 4), p); prod(i=1, #f, (p=nextprime(p+1))^f[i]); };  \\ This function from Charles R Greathouse IV, Aug 17 2011
write_to_bfile(1,rgs_transform(vector(65537,n,((-1)^n)*A046523(n))),"b291761.txt");
\\ Or alternatively:
f(n) = if(1==n,n,A046523(n)+(n%2));
write_to_bfile(1,rgs_transform(vector(16385,n,f(n))),"b291761.txt");

A300827 Lexicographically earliest sequence such that a(i) = a(j) => A324193(i) = A324193(j) for all i, j >= 1.

Original entry on oeis.org

1, 2, 2, 3, 2, 4, 2, 4, 5, 6, 2, 7, 2, 8, 9, 10, 2, 11, 2, 12, 13, 14, 2, 15, 16, 17, 9, 18, 2, 19, 2, 20, 21, 22, 23, 24, 2, 25, 26, 27, 2, 28, 2, 29, 30, 31, 2, 32, 33, 34, 35, 36, 2, 37, 38, 39, 40, 41, 2, 42, 2, 43, 44, 45, 46, 47, 2, 48, 49, 50, 2, 51, 2, 52, 53, 54, 55, 56, 2, 57, 58, 59, 2, 60, 61, 62, 63, 64, 2, 65, 66, 67

Offset: 1

Antti Karttunen, Mar 13 2018

nonn

Apart from primes, the sequence contains duplicate values at points p*q and p^3, where p*q are the product of two successive primes, with p < q (sequences A006094, A030078). Question: are there any other cases where a(x) = a(y), with x < y ?
The reason why this is not equal to A297169: Even though A297112 contains only powers of two after the initial zero, as A297112(n) = 2^A033265(A156552(d)) for n > 1, and A297168(n) is computed as Sum_{d|n, dA297112(d), still a single 1-bit in binary expansion of A297168(n) might be formed as a sum of several terms of A297112(d), i.e., could be born of carries.
From Antti Karttunen, Feb 28 2019: (Start)
  A297168(n) = Sum_{d|n, dA297112(d) will not produce any carries (in base-2) if and only if n is a power of prime. Only in that case the number of summands (A000005(n)-1) is equal to the number of prime factors counted with multiplicity, A001222(n) = A000120(A156552(n)). (A notable subset of such numbers is A324201, numbers that are mapped to even perfect numbers by A156552). Precisely because there are so few points with duplicate values (apart from primes), this sequence is not particularly good for filtering other sequences, because the number of false positives is high. Any of the related sequences like A324203, A324196, A324197 or A324181 might work better in that respect. In any case, the following implications hold (see formula section of A324193 for the latter): (End)
For all i, j:
  a(i) = a(j) => A297168(i) = A297168(j). (The same holds for A297169).
  a(i) = a(j) => A324181(i) = A324181(j) => A324120(i) = A324120(j).

			For n = 15, with proper divisors 3 and 5, we have f(n) = prime(1+A297167(3)) * prime(1+A297167(5)) = prime(2)*prime(3) = 3*5 = 15.
For n = 27, with proper divisors 3 and 9, we have f(n) = prime(1+A297167(3)) * prime(1+A297167(9)) = prime(2)*prime(3) = 3*5 = 15.
Because f(15) = f(27), the restricted growth sequence transform allots the same number (in this case 9) for both, so a(15) = a(27) = 9.

Antti Karttunen, Table of n, a(n) for n = 1..65537
Index entries for sequences computed from indices in prime factorization

Cf. A000120, A000961, A006094, A030078, A046660, A061395, A101296, A156552, A297112, A297167, A297168, A297169, A324193, A324120, A324201.

Cf. also A324181, A323914, A324196, A324197, A324203.

up_to = 65537;
rgs_transform(invec) = { my(om = Map(), outvec = vector(length(invec)), u=1); for(i=1, length(invec), if(mapisdefined(om,invec[i]), my(pp = mapget(om, invec[i])); outvec[i] = outvec[pp] , mapput(om,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])); }
A061395(n) = if(1==n, 0, primepi(vecmax(factor(n)[, 1]))); \\ After M. F. Hasler's code for A006530.
A297167(n) = if(1==n, 0, (A061395(n) + (bigomega(n)-omega(n)) -1));
Aux300827(n) = { my(m=1); if(n<=2, n-1, fordiv(n,d,if((d>1)&(dA297167(d)))); (m)); };
write_to_bfile(1,rgs_transform(vector(up_to,n,Aux300827(n))),"b300827.txt");

Restricted growth sequence transform of sequence f, defined as f(1) = 0, f(2) = 1, and for n > 2, f(n) = Product_{d|n, 1A297167(d)).
a(p) = 2 for all primes p.
a(A006094(n)) = a(A030078(n)), for all n >= 1.

Name changed by Antti Karttunen, Feb 21 2019

A100565 a(n) = Card{(x,y,z) : x <= y <= z, x|n, y|n, z|n, gcd(x,y)=1, gcd(x,z)=1, gcd(y,z)=1}.

Original entry on oeis.org

1, 2, 2, 3, 2, 5, 2, 4, 3, 5, 2, 8, 2, 5, 5, 5, 2, 8, 2, 8, 5, 5, 2, 11, 3, 5, 4, 8, 2, 15, 2, 6, 5, 5, 5, 13, 2, 5, 5, 11, 2, 15, 2, 8, 8, 5, 2, 14, 3, 8, 5, 8, 2, 11, 5, 11, 5, 5, 2, 25, 2, 5, 8, 7, 5, 15, 2, 8, 5, 15, 2, 18, 2, 5, 8, 8, 5, 15, 2, 14, 5, 5, 2, 25, 5, 5, 5, 11, 2, 25, 5, 8, 5, 5, 5, 17

Offset: 1

Vladeta Jovovic, Nov 28 2004

First differs from A018892 at a(30) = 15, A018892(30) = 14.
First differs from A343654 at a(210) = 51, A343654(210) = 52.
Also a(n) = Card{(x,y,z) : x <= y <= z and lcm(x,y)=n, lcm(x,z)=n, lcm(y,z)=n}.
In words, a(n) is the number of pairwise coprime unordered triples of divisors of n. - Gus Wiseman, May 01 2021

			From _Gus Wiseman_, May 01 2021: (Start)
The a(n) triples for n = 1, 2, 4, 6, 8, 12, 24:
  (1,1,1)  (1,1,1)  (1,1,1)  (1,1,1)  (1,1,1)  (1,1,1)   (1,1,1)
           (1,1,2)  (1,1,2)  (1,1,2)  (1,1,2)  (1,1,2)   (1,1,2)
                    (1,1,4)  (1,1,3)  (1,1,4)  (1,1,3)   (1,1,3)
                             (1,1,6)  (1,1,8)  (1,1,4)   (1,1,4)
                             (1,2,3)           (1,1,6)   (1,1,6)
                                               (1,2,3)   (1,1,8)
                                               (1,3,4)   (1,2,3)
                                               (1,1,12)  (1,3,4)
                                                         (1,3,8)
                                                         (1,1,12)
                                                         (1,1,24)
(End)

Antti Karttunen, Table of n, a(n) for n = 1..10000

Cf. A000005, A070919, A086222, A086165, A048691, A063647.
Positions of 2's through 5's are A000040, A001248, A030078, A068993.
The version for subsets of {1..n} instead of divisors is A015617.
The version for pairs of divisors is A018892.
The ordered version is A048785.
The strict case is A066620.
The version for strict partitions is A220377.
A version for sets of divisors of any size is A225520.
The version for partitions is A307719 (no 1's: A337563).
The case of distinct parts coprime is A337600 (ordered: A337602).
A001399(n-3) = A069905(n) = A211540(n+2) counts 3-part partitions.
A007304 ranks 3-part strict partitions.
A014311 ranks 3-part compositions.
A014612 ranks 3-part partitions.
A051026 counts pairwise indivisible subsets of {1..n}.
A302696 lists Heinz numbers of pairwise coprime partitions.
A337461 counts 3-part pairwise coprime compositions.
Cf. A000961, A000977, A007360, A023022, A087087, A276187, A282935, A337601, A337603, A338331, A343652, A343654.

pwcop[y_]:=And@@(GCD@@#==1&/@Subsets[y,{2}]);
Table[Length[Select[Tuples[Divisors[n],3],LessEqual@@#&&pwcop[#]&]],{n,30}] (* Gus Wiseman, May 01 2021 *)

A100565(n) = (numdiv(n^3)+3*numdiv(n)+2)/6; \\ Antti Karttunen, May 19 2017

a(n) = (tau(n^3) + 3*tau(n) + 2)/6.

A176509 Composite numbers m for which A064380(m) = A000010(m).

Original entry on oeis.org

8, 27, 125, 128, 343, 1331, 2187, 2197, 4913, 6859, 12167, 24389, 29791, 32768, 50653, 68921, 78125, 79507, 103823, 148877, 205379, 226981, 300763, 357911, 389017, 493039, 571787, 704969, 823543, 912673, 1030301, 1092727, 1225043, 1295029, 1442897, 2048383, 2248091

Offset: 1

Vladimir Shevelev, Apr 19 2010

nonn

Theorem. A064380(m) = A000010(m) iff m has the form m=p^(2^k-1), k>=1, p a prime. Eliminating the primes (k=1), the terms of the sequence have this form for k>1. All terms of A030078 (k=2) and A092759 (k=3) and prime powers of A010803 (k=4) are in the sequence, for example.

Amiram Eldar, Table of n, a(n) for n = 1..10000

Cf. A000010, A010803, A030078, A050376, A056824, A064380, A092759, A176472.

seq[max_] := Module[{ps = Select[Range[Floor[Surd[max, 3]]], PrimeQ], e, k, s = {}}, Do[e = Floor[Log[ps[[i]], max]]; k = Floor[Log2[e + 1]]; s = Join[s, ps[[i]]^(2^Range[2, k] - 1)], {i, 1, Length[ps]}]; Sort[s]]; seq[3*10^6] (* Amiram Eldar, Mar 26 2023 *)

is(n)=my(e=isprimepower(n));e>2 && 2^valuation(e+1,2)==e+1 \\ Charles R Greathouse IV, Feb 19 2013

a(n) ~ n^3 log^3 n. - Charles R Greathouse IV, Feb 19 2013

Sum_{n>=1} 1/a(n) = Sum_{k>=2} 1/P(2^k-1) = 0.183077059924063305405..., where P(s) is the prime zeta function. - Amiram Eldar, Jul 11 2024

128 inserted, 1024 deleted, 2187 inserted, 32768 inserted, etc. - R. J. Mathar, Nov 21 2010

More terms from Amiram Eldar, Mar 26 2023

A285508 Numbers with exactly three prime factors, not all distinct.

Original entry on oeis.org

8, 12, 18, 20, 27, 28, 44, 45, 50, 52, 63, 68, 75, 76, 92, 98, 99, 116, 117, 124, 125, 147, 148, 153, 164, 171, 172, 175, 188, 207, 212, 236, 242, 244, 245, 261, 268, 275, 279, 284, 292, 316, 325, 332, 333, 338, 343, 356, 363, 369, 387, 388, 404, 412, 423, 425, 428, 436, 452

Offset: 1

Kalle Siukola, Apr 20 2017

Cubes of primes together with products of a prime and the square of a different prime.

Numbers k for which A001222(k) = 3, but A001221(k) < 3. - Antti Karttunen, Apr 20 2017

Antti Karttunen, Table of n, a(n) for n = 1..10000
Kalle Siukola, Python program

Cf. A001221, A001222.
Setwise difference of A014612 and A007304.
Union of A030078 and A054753.

N:= 1000: # for terms <= N
P:= select(isprime, [2,seq(i,i=3..N/4,2)]): nP:= nops(P):
sort(select(`<=`,[seq(seq(P[i]*P[j]^2,i=1..nP),j=1..nP)],N)); # Robert Israel, Oct 20 2024

Select[Range[452], PrimeOmega[#] == 3 && PrimeNu[#] < 3 &] (* Giovanni Resta, Apr 20 2017 *)

isA285508(n) = ((omega(n) < 3) && (bigomega(n) == 3));
n=0; k=1; while(k <= 10000, n=n+1; if(isA285508(n),write("b285508.txt", k, " ", n);k=k+1));
\\ Antti Karttunen, Apr 20 2017

from sympy import primefactors, primeomega
def omega(n): return len(primefactors(n))
def bigomega(n): return primeomega(n)
print([n for n in range(1, 501) if omega(n)<3 and bigomega(n) == 3]) # Indranil Ghosh, Apr 20 2017 and Kalle Siukola, Oct 25 2023

from math import isqrt
from sympy import primepi, primerange, integer_nthroot
def A285508(n):
    def bisection(f,kmin=0,kmax=1):
        while f(kmax) > kmax: 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-sum(primepi(x//(k**2))-(a<<1)+primepi(isqrt(x//k))-1 for a,k in enumerate(primerange(integer_nthroot(x,3)[0]+1))))
    return bisection(f,n,n) # Chai Wah Wu, Oct 20 2024

;; With my IntSeq-library.
(define A285508 (MATCHING-POS 1 1 (lambda (n) (and (= 3 (A001222 n)) (< (A001221 n) 3))))) ;; Antti Karttunen, Apr 20 2017

A007964 Numbers k such that product of proper divisors of k is <= k; i.e., product of divisors of k is <= k^2.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 14, 15, 17, 19, 21, 22, 23, 25, 26, 27, 29, 31, 33, 34, 35, 37, 38, 39, 41, 43, 46, 47, 49, 51, 53, 55, 57, 58, 59, 61, 62, 65, 67, 69, 71, 73, 74, 77, 79, 82, 83, 85, 86, 87, 89, 91, 93, 94, 95, 97, 101, 103, 106

Offset: 1

R. Muller

Numbers which are the product of up to two primes (not necessarily distinct) or the cube of a prime. Alternatively, numbers having prime decomposition p*q, where q either is distinct from p or equals p^k for 0 <= k <= 2.
Corresponds to numbers having at most four divisors. (For numbers with exactly four divisors see A030513.) - Lekraj Beedassy, Sep 23 2003
For n > 3: numbers that can occur as fourth divisors; union of A000040, A001248, A006881 and A030078. - Reinhard Zumkeller, May 15 2006

Liu Hongyan and Zhang Wenpeng, On the simple numbers and the mean value properties, Smarandache Notions (Book Series, Vol. 14), American Research Press, 2004; pp. 171-175.

Amiram Eldar, Table of n, a(n) for n = 1..10000
F. Smarandache, Only Problems, Not Solutions! (listing the sequence as the "simple numbers" in Unsolved Problem: 23 p.23).

Cf. A007955, A058080.

Select[Range[100], DivisorSigma[0, #] < 5 &] (* Amiram Eldar, Apr 30 2020 *)

is(n)=numdiv(n)<5 \\ Charles R Greathouse IV, Sep 16 2015

Description corrected by Henry Bottomley, Nov 24 2000

cp's OEIS Frontend

A168363 Squares and cubes of primes.

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

PARI

PARI

Python

Formula

A182944 Square array A(i,j), i >= 1, j >= 1, of prime powers prime(i)^j, by descending antidiagonals.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A376936 Powerful numbers divisible by cubes of 2 distinct primes.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A133534 Sum of third powers of two consecutive primes.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A291761 Restricted growth sequence transform of ((-1)^n)*A046523(n); filter combining the parity and the prime signature of n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

A300827 Lexicographically earliest sequence such that a(i) = a(j) => A324193(i) = A324193(j) for all i, j >= 1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Formula

Extensions

A100565 a(n) = Card{(x,y,z) : x <= y <= z, x|n, y|n, z|n, gcd(x,y)=1, gcd(x,z)=1, gcd(y,z)=1}.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A176509 Composite numbers m for which A064380(m) = A000010(m).