|
%I #32 Aug 30 2014 13:13:27
%S 2,40,463,5081,53722,557687,5730883,58527612,595228791,6035604901,
%T 61067111413,616833883887,6222429697992,62704089037652,
%U 631334954674157,6352077572091621
%N The number of n-digit numbers requiring 3 nonzero squares in their representation as sum of squares.
%C A049415(n) + A180426(n) + a(n) + A180347(n) = A052268(n)
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/LagrangesFour-SquareTheorem.html">Lagrange's Four-Square Theorem</a>, <a href="http://mathworld.wolfram.com/SumofSquaresFunction.html">Sum of Squares Function</a>.
%F a(n) = A180425(n)-A180425(n-1) for n>1.
%Y Cf. A000419, A180425.
%K nonn,more,base
%O 1,1
%A _Martin Renner_, Jan 19 2011
%E a(6) from _Lars Blomberg_, Jun 29 2011
%E a(7)-a(10) from _Donovan Johnson_, Jul 01 2011
%E a(10) corrected and a(11)-a(16) added by _Hiroaki Yamanouchi_, Aug 30 2014
|
