A181405 - OEIS

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

A181405

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

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 * A354568 A072117 A162853` `Adjacent sequences: A181402 A181403 A181404 * A181406 A181407 A181408`
	KEYWORD	`nonn,base`
	AUTHOR	`Martin Renner, Jan 28 2011`
	STATUS	`approved`

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 8 04:42 EST 2023. Contains 367662 sequences. (Running on oeis4.)