The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A277192 Number of integers k in range [n^2, ((n+1)^2)-1] for which the least number of squares that add up to k (A002828) is even. 5
 1, 1, 3, 3, 4, 6, 6, 8, 8, 9, 11, 10, 13, 12, 13, 16, 15, 16, 17, 19, 17, 22, 20, 21, 23, 24, 23, 25, 26, 26, 28, 30, 28, 30, 31, 31, 31, 34, 34, 35, 35, 37, 37, 40, 38, 41, 42, 40, 44, 43, 44, 45, 44, 46, 45, 50, 50, 49, 48, 54, 53, 52, 52, 57, 55, 56, 57, 58, 58, 60, 60, 58, 65, 61, 64, 66, 64, 65, 66, 68, 69, 68, 70, 69 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Antti Karttunen, Table of n, a(n) for n = 0..512 FORMULA a(n) = Sum_{i=n^2 .. ((n+1)^2)-1} (1-A000035(A002828(i))). For all n >= 0, A277191(n) + a(n) = 2n+1. For n >= 1, a(n) = A077773(n) + A277194(n). PROG (Scheme) (define (A277192 n) (add (lambda (i) (- 1 (A000035 (A002828 i)))) (A000290 n) (+ -1 (A000290 (+ 1 n))))) ;; Implements sum_{i=lowlim..uplim} intfun(i) (define (add intfun lowlim uplim) (let sumloop ((i lowlim) (res 0)) (cond ((> i uplim) res) (else (sumloop (1+ i) (+ res (intfun i))))))) CROSSREFS Cf. A000035, A000290, A002828, A077773, A277191, A277194. Sequence in context: A092200 A130481 A145805 * A098238 A088651 A161019 Adjacent sequences:  A277189 A277190 A277191 * A277193 A277194 A277195 KEYWORD nonn AUTHOR Antti Karttunen, Oct 04 2016 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 April 21 10:53 EDT 2021. Contains 343150 sequences. (Running on oeis4.)