This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS See A255250 for a comment on Gauss's circle problem in an octant and a link. LINKS 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: A244040 A064514 A112342 * A063712 A185977 A204006 Adjacent sequences:  A256091 A256092 A256093 * A256095 A256096 A256097 KEYWORD nonn,easy AUTHOR Wolfdieter Lang, Mar 14 2015 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 18 01:19 EDT 2019. Contains 326059 sequences. (Running on oeis4.)