The OEIS is supported by the many generous donors to the OEIS Foundation.

 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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A181377 Total number of positive integers below 10^n requiring 3 positive cubes in their representation as sum of cubes. 9
 1, 15, 122, 1128, 10678, 103421, 1017326, 10077684, 100294216 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS A061439(n) + A181375(n) + a(n) + A181379(n) + A181381(n) + A181400(n) + A181402(n) + A181404(n) + A130130(n) = A002283(n) LINKS Table of n, a(n) for n=1..9. Weisstein, Eric W.: MathWorld -- Waring's Problem. CROSSREFS Cf. A047702 Sequence in context: A120794 A264377 A038743 * A264046 A349295 A027839 Adjacent sequences: A181374 A181375 A181376 * A181378 A181379 A181380 KEYWORD nonn,more AUTHOR Martin Renner, Jan 28 2011 EXTENSIONS a(5)-a(9) from Lars Blomberg, May 04 2011 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 2 15:23 EST 2023. Contains 367524 sequences. (Running on oeis4.)