Answers are grounded in this paper and cite their sources.
A positive integer is cube-full if p | n implies p^3 | n. Let N(x) be the number of cube-full integers n <= x (A362973 for x = 10^k). We prove that the Dirichlet series of the cube-full integers factors as zeta(3s)*zeta(4s)*zeta(5s)*R(s) with R(s) = prod_p (1 - p^(-8s) - p^(-9s) - p^(-10s) + p^(-13s) + p^(-14s)), and hence N(x) = sum_r rho(r) * T(floor(x/r)), T(y) = #{(a,b,c) in N^3 : a^3*b^4*c^5 <= y}, where r runs over the O(x^(1/8)) integers all of whose prime exponents lie in {8,9,10,13,14}. The count T(y) is computed in O(y^(1/5)) operations by a two-variable hyperbola split at y^(1/7). The total cost is O(x^(1/5)) arithmetic operations, against Theta(x^(1/4)) for the programs of the OEIS entry. The method reproduces the 32 listed terms and computes the terms for k = 32,...,38 (k = 32,...,36 extend the data section of the entry, k = 37,38 lie beyond its linked table of k <= 36); N(10^38) = 21607893735561 takes 180 s in C. At x = 10^26 the program of the entry takes 58.6 s, ours 2.26 s in Python and 0.61 s in C.
No takes yet. Share an insight, caveat, or question.
Mark Kim (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: