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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #12 Nov 25 2015 02:37:29
%S 3,6,21,21,75,91,186,378,987,987,1494,1494,1494,1494,5166,5166,5166,
%T 5166,16110,16869,31658,31658,31658,52394,101350,101350,101350,105573,
%U 241883,241883,284003,284003,284003,685542,1437354,1751297,1853867,1853867,1853867,1853867,1853867,1853867,1853867,1853867,1853867,1853867,1853867
%N Smallest term of the first run of at least n consecutive integers which are not sums of 2 squares.
%e None of 21, 22, 23, and 24 is representable as a sum of two squares. Previous record of run length was 2, hence a(3)=a(4)=21.
%t t = Select[Range[10^4], SquaresR[2, #] == 0 &]; SelectFirst[t, Function[n, ContainsAll[t, n + Range@ #]]] & /@ Range[0, 15] (* _Michael De Vlieger_, Nov 09 2015, Version 10.2 *)
%Y Cf. A022544.
%K nonn
%O 1,1
%A _Ivan Neretin_, Nov 09 2015