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 A256094 #7 Mar 15 2015 01:45:39 %S A256094 1,2,2,3,4,3,4,5,4,6,7,7,8,8,7,8,8,10,10,12,13,14,11,13,13,11,14,16, %T A256094 15,18,17,16,15,17,17,20,20,23,23,21,21,21,19,23,22,24,26,26,23,25,24, %U A256094 28,29,31,30,32,29,31,28,29,31 %N A256094 Alternating row sums of array A255250. %C A256094 See A255250 for a comment on Gauss's circle problem in an octant and a link. %F A256094 a(n) = sum((-1)^m*T(n, m), m=0..floor(n/sqrt(2))), n >= 0, with T(n, m) = A255250(n, m) = floor(sqrt(n^2 - m^2)) - (m-1). %Y A256094 Cf. A255250. %K A256094 nonn,easy %O A256094 0,2 %A A256094 _Wolfdieter Lang_, Mar 14 2015