login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Total number of positive integers below 10^n requiring 4 positive cubes in their representation as sum of cubes.
9

%I #16 Feb 13 2024 06:39:29

%S 1,18,242,3343,46683,605489,7221246,80884939,865304098

%N Total number of positive integers below 10^n requiring 4 positive cubes in their representation as sum of cubes.

%C A061439(n) + A181375(n) + A181377(n) + a(n) + A181381(n) + A181400(n) + A181402(n) + A181404(n) + A130130(n) = A002283(n).

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/WaringsProblem.html">Waring's Problem</a>.

%Y Cf. A047703.

%K nonn,more

%O 1,2

%A _Martin Renner_, Jan 28 2011

%E a(5)-a(9) from _Lars Blomberg_, May 04 2011