cp's OEIS Frontend

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.

A062862 Number of ways n can be written as the sum of squares of consecutive numbers (possibly including squares of negative numbers).

Original entry on oeis.org

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
Offset: 0

Views

Author

Henry Bottomley, Jun 25 2001

Keywords

Examples

			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.