login

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”).

A256094
Alternating row sums of array A255250.
1
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, 15, 18, 17, 16, 15, 17, 17, 20, 20, 23, 23, 21, 21, 21, 19, 23, 22, 24, 26, 26, 23, 25, 24, 28, 29, 31, 30, 32, 29, 31, 28, 29, 31
OFFSET
0,2
COMMENTS
See A255250 for a comment on Gauss's circle problem in an octant and a link.
FORMULA
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).
CROSSREFS
Cf. A255250.
Sequence in context: A328804 A064514 A112342 * A063712 A340458 A185977
KEYWORD
nonn,easy
AUTHOR
Wolfdieter Lang, Mar 14 2015
STATUS
approved