This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A276571 #8 Sep 08 2016 17:51:48
%S A276571 0,1,2,2,3,3,4,4,4,4,5,5,5,5,6,6,6,6,6,7,7,7,7,7,8,8,8,8,8,8,8,9,9,9,
%T A276571 9,9,9,9,10,10,10,10,10,10,10,11,11,11,11,11,11,11,11,12,12,12,12,12,
%U A276571 12,12,12,12,12,13,13,13,13,13,13,13,13,13,14,14,14,14,14,14,14,14,14,14,15
%N A276571 After a(0)=0, each n occurs A260734(n) times.
%C A276571 Auxiliary function for computing A276572 & A276573.
%H A276571 Antti Karttunen, <a href="/A276571/b276571.txt">Table of n, a(n) for n = 0..10028</a>
%t A276571 Table[Table[n, {Length[#] - 1 &@ NestWhileList[# - (If[First@ # > 0, 1, Length[ First@ Split@ #] + 1] &@ SquaresR[Range@ 4, #]) &, ((n + 1)^2) - 1, # != (n^2) - 1 &]}], {n, 15}] // Flatten (* _Michael De Vlieger_, Sep 08 2016 *)
%o A276571 (Scheme) (define (A276571 n) (let loop ((k 0)) (if (>= (A260733 (+ 1 k)) n) k (loop (+ 1 k)))))
%Y A276571 Cf. A260733, A260734, A276572, A276573.
%Y A276571 Cf. also A276581.
%K A276571 nonn
%O A276571 0,3
%A A276571 _Antti Karttunen_, Sep 07 2016