|
%I #14 Feb 13 2024 08:16:01
%S 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,
%T 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,
%U 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
%N Total number of n-digit numbers requiring 8 positive cubes in their representation as sum of cubes.
%C Arthur Wieferich proved that only 15 integers require eight cubes, cf. A018889.
%C A181354(n) + A181376(n) + A181378(n) + A181380(n) + A181384(n) + A181401(n) + A181403(n) + a(n) + A171386(n) = A052268(n)
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/WaringsProblem.html">Waring's Problem</a>.
%F a(n) = A181404(n) - A181404(n-1).
%Y Cf. A018889, A181404.
%K nonn,base
%O 1,2
%A _Martin Renner_, Jan 28 2011
|
