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!)
 A062862 Number of ways n can be written as the sum of squares of consecutive numbers (possibly including squares of negative numbers). 2
 1, 4, 1, 0, 2, 4, 2, 0, 0, 2, 1, 0, 0, 2, 4, 2, 2, 0, 0, 2, 0, 0, 0, 0, 0, 4, 0, 0, 1, 2, 4, 2, 0, 0, 0, 2, 2, 0, 0, 0, 0, 2, 0, 0, 2, 0, 0, 0, 0, 2, 2, 0, 0, 0, 2, 4, 2, 0, 0, 0, 3, 2, 0, 0, 2, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 2, 0, 0, 0, 4, 2, 0, 0, 0, 2, 4, 2, 0, 0, 0, 2, 0, 0, 0, 2, 0, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS EXAMPLE a(25)=4 since 25 = 5^2 = 3^2+4^2 = (-4)^2+(-3)^2 = (-5)^2. CROSSREFS If a(n) is zero then n is in A062863, otherwise in A062861. If a(n) is odd then n is in A006331. Sequence in context: A124539 A249094 A096501 * A206799 A084119 A166073 Adjacent sequences:  A062859 A062860 A062861 * A062863 A062864 A062865 KEYWORD nonn AUTHOR Henry Bottomley, Jun 25 2001 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 June 6 01:16 EDT 2020. Contains 334858 sequences. (Running on oeis4.)