login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A181405 Total number of n-digit numbers requiring 8 positive cubes in their representation as sum of cubes. 8
0, 3, 12, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Arthur Wieferich proved that only 15 integers require eight cubes, cf. A018889.

A181354(n) + A181376(n) + A181378(n) + A181380(n) + A181384(n) + A181401(n) + A181403(n) + a(n) + A171386(n) = A052268(n)

LINKS

Table of n, a(n) for n=1..83.

Weisstein, Eric W.: MathWorld -- Waring's Problem.

FORMULA

a(n) = A181404(n)-A181404(n-1)

CROSSREFS

Cf. A018889

Sequence in context: A212814 A101710 A088799 * A072117 A162853 A162854

Adjacent sequences:  A181402 A181403 A181404 * A181406 A181407 A181408

KEYWORD

nonn,base

AUTHOR

Martin Renner, Jan 28 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 15 22:25 EDT 2019. Contains 328038 sequences. (Running on oeis4.)