This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A181401 Total number of n-digit numbers requiring 6 positive cubes in their representation as sum of cubes. 8
 1, 17, 184, 1123, 2115, 479, 3, 0, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS A181354(n) + A181376(n) + A181378(n) + A181380(n) + A181384(n) + a(n) + A181403(n) + A181405(n) + A171386(n) = A052268(n) LINKS Eric W. Weisstein, MathWorld -- Waring's Problem. FORMULA a(n) = A181400(n)-A181400(n-1) CROSSREFS Cf. A046040 Sequence in context: A055904 A116964 A167578 * A243419 A270497 A025958 Adjacent sequences:  A181398 A181399 A181400 * A181402 A181403 A181404 KEYWORD nonn,more,base AUTHOR Martin Renner, Jan 28 2011 EXTENSIONS a(5)-a(9) from Lars Blomberg, Jan 15 2014 STATUS approved

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

Last modified December 14 09:41 EST 2019. Contains 329979 sequences. (Running on oeis4.)