|
%I #25 Jul 31 2022 07:43:54
%S 0,3,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,
%T 15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,
%U 15,15,15,15,15,15,15,15,15,15,15,15,15,15,15
%N Total number of positive integers below 10^n requiring 8 positive cubes in their representation as sum of cubes.
%C A061439(n) + A181375(n) + A181377(n) + A181379(n) + A181381(n) + A181400(n) + A181402(n) + a(n) + A130130(n) = A002283(n).
%C Also continued fraction expansion of (9+sqrt(229))/74. - _Bruno Berselli_, Sep 09 2011
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/WaringsProblem.html">Waring's Problem</a>
%H <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (1).
%F a(n) = 15 for n > 2. - _Charles R Greathouse IV_, Sep 09 2011
%F G.f.: 3*x*(1+4*x)/(1-x). - _Bruno Berselli_, Sep 09 2011
%o (PARI) a(n)=if(n>2,15,3*n-3) \\ _Charles R Greathouse IV_, Oct 07 2015
%Y Cf. A018889, A010854.
%K nonn,easy
%O 1,2
%A _Martin Renner_, Jan 28 2011
%E a(5)-a(7) from _Lars Blomberg_, May 04 2011
|
