A370788 -id:A370788 - cp's OEIS frontend

A370786 Powerful numbers with an odd number of prime factors (counted with multiplicity).

8, 27, 32, 72, 108, 125, 128, 200, 243, 288, 343, 392, 432, 500, 512, 648, 675, 800, 968, 972, 1125, 1152, 1323, 1331, 1352, 1372, 1568, 1728, 1800, 2000, 2048, 2187, 2197, 2312, 2592, 2700, 2888, 3087, 3125, 3200, 3267, 3528, 3872, 3888, 4232, 4500, 4563, 4608

Offset: 1

Amiram Eldar, Mar 02 2024

Jakimczuk (2024) proved:
The number of terms that do not exceed x is N(x) = c * sqrt(x) + o(sqrt(x)) where c = (zeta(3/2)/zeta(3) - 1/zeta(3/2))/2 = 0.895230... .
The relative asymptotic density of this sequence within the powerful numbers is (1 - zeta(3)/(zeta(3/2)^2))/2 = 0.411930... .
In general, the relative asymptotic density of the s-full numbers (numbers whose exponents in their prime factorization are all >= s) with an odd number of prime factors (counted with multiplicity) within the s-full numbers is smaller than 1/2 when s is odd.

Amiram Eldar, Table of n, a(n) for n = 1..10000
Rafael Jakimczuk, Arithmetical Functions over the Powerful Part of an Integer, ResearchGate, 2024.

Intersection of A001694 and A026424.
Complement of A370785 within A001694.
A370788 is a subsequence.
Cf. A002117, A078434, A090699.

q[n_] := Module[{e = FactorInteger[n][[;; , 2]]}, AllTrue[e, # > 1 &] && OddQ[Total[e]]]; Select[Range[2500], q]

is(n) = {my(e = factor(n)[, 2]); n > 1 && vecmin(e) > 1 && vecsum(e)%2;}

A370787 Cubefull numbers with an even number of prime factors (counted with multiplicity).

Original entry on oeis.org

1, 16, 64, 81, 216, 256, 625, 729, 864, 1000, 1024, 1296, 1944, 2401, 2744, 3375, 3456, 4000, 4096, 5184, 6561, 7776, 9261, 10000, 10648, 10976, 11664, 13824, 14641, 15625, 16000, 16384, 17496, 17576, 20736, 25000, 28561, 30375, 31104, 35937, 38416, 39304, 40000

Offset: 1

Amiram Eldar, Mar 02 2024

Jakimczuk (2024) proved:
The number of terms that do not exceed x is N(x) = c * x^(1/3) / 2 + o(x^(1/3)) where c = A362974.
The relative asymptotic density of this sequence within the cubefull numbers is 1/2.
In general, the relative asymptotic density of the s-full numbers (numbers whose exponents in their prime factorization are all >= s) with an even number of prime factors (counted with multiplicity) within the s-full numbers is 1/2 when s is odd.

Amiram Eldar, Table of n, a(n) for n = 1..10000
Rafael Jakimczuk, Arithmetical Functions over the Powerful Part of an Integer, ResearchGate, 2024.

Intersection of A036966 and A028260.
Complement of A370788 within A036966.
Subsequence of A370785.
Cf. A362974.

q[n_] := Module[{e = FactorInteger[n][[;; , 2]]}, AllTrue[e, # > 2 &] && OddQ[Total[e]]]; Select[Range[30000], q]

is(n) = {my(e = factor(n)[, 2]); n > 1 && vecmin(e) > 2 && vecsum(e)%2;}

cp's OEIS Frontend

A370786 Powerful numbers with an odd number of prime factors (counted with multiplicity).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI