This site is supported by donations to The OEIS Foundation.

 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

%I

%S 1,17,184,1123,2115,479,3,0,0

%N Total number of n-digit numbers requiring 6 positive cubes in their representation as sum of cubes.

%C A181354(n) + A181376(n) + A181378(n) + A181380(n) + A181384(n) + a(n) + A181403(n) + A181405(n) + A171386(n) = A052268(n)

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

%F a(n) = A181400(n)-A181400(n-1)

%Y Cf. A046040

%K nonn,more,base

%O 1,2

%A _Martin Renner_, Jan 28 2011

%E a(5)-a(9) from _Lars Blomberg_, Jan 15 2014

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 October 21 11:34 EDT 2019. Contains 328296 sequences. (Running on oeis4.)