%I #28 Jun 20 2024 18:36:11
%S 0,1,2,3,5,6,9,10,14,18,26,30,42,54,66,78,90,114,126,150,186,198,210,
%T 270,330,378,390,450,510,546,570,630,798,810,882,930,990,1050,1170,
%U 1350,1386,1470,1530,1638,1650,1710,1890,2250,2310,2610,2730,2970,3150,3510,3570
%N Numbers k such that A000118(k) is a record.
%C This sequence is equivalent to numbers k such that sigma(k) > sigma(m) for all m < k where m and k are not multiples of 4 as no terms are multiples of 4 and A000118(n) = 8*sigma(n) for nonmultiples of 4. - _David A. Corneth_, May 19 2023
%H David A. Corneth, <a href="/A128689/b128689.txt">Table of n, a(n) for n = 1..392</a> (terms <= 10^8)
%t f[n_] := SquaresR[4, n];
%t Module[{record = -1, n}, Reap[For[n = 0, n <= 2000, n++, If[f[n] > record, record = f[n]; Sow[n]]]][[2, 1]]] (* _Jean-François Alcover_, May 18 2023 *)
%t DeleteDuplicates[Table[{n,SquaresR[4,n]},{n,0,3600}],GreaterEqual[#1[[2]],#2[[2]]]&][[;;,1]] (* _Harvey P. Dale_, Jun 20 2024 *)
%Y Cf. A000118 (number of ways of writing n as a sum of 4 squares), A002093, A042968 A128690.
%K nonn
%O 1,3
%A _Jonathan Vos Post_, Mar 21 2007
%E Missing term 378 added by _Giovanni Resta_, Jun 18 2016
%E More terms from _Jean-François Alcover_, May 18 2023
%E More terms from _David A. Corneth_, May 18 2023