OFFSET
1,1
COMMENTS
Erdős and Ivić conjectured every sufficiently large integer is the sum of at most r+1 many r-full numbers, which would imply this sequence is finite. Heath-Brown has proved the conjecture for r=2.
The last known term is a(45) = 2039. There are no other terms < 84000.
There are no other terms < 10^9. See Python program in links. - David Cleaver, Feb 17 2026
REFERENCES
D. R. Heath-Brown, "Ternary Quadratic Forms and Sums of Three Square-Full Numbers." In Séminaire de Théorie des Nombres, Paris 1986-87 (Ed. C. Goldstein). Boston, MA: Birkhauser, pp. 137-163, 1988.
LINKS
Thomas Bloom, Problem #1107, Erdős Problems.
David Cleaver, Python program.
EXAMPLE
Smallest cubefull numbers are 1, 8, 16, 27, 32, 64... so no four of them add to 5, 6, 7, 12, 13, 14, 15, 20, 21, 22, 23 or 31.
MATHEMATICA
n=41000;
t=Join[{0, 1}, Select[Range[2, n], Min[Table[# [[2]], {1}] & /@ FactorInteger[#]] > 2&]];
Complement[Range[n], Flatten[Outer[Plus, t, t, t, t]]]
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Elijah Beregovsky, Jan 07 2026
STATUS
approved
