A106594 - OEIS

This site is supported by donations to The OEIS Foundation.

A106594

a(n) = number of primitive solutions to 4n+1 = x^2 + y^2.

1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 2, 0, 1, 0, 0, 2, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 2, 1, 0, 1, 0, 0, 1, 1, 0, 1, 2, 0, 1, 1, 0, 2, 0, 0, 0, 2, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 2, 1, 0, 1, 1, 0, 1, 1, 0, 0, 2, 0, 1, 1, 0, 2, 0, 0, 1, 0, 0, 1, 1, 0, 0, 2, 0, 1, 2, 0, 0, 1, 0, 1 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,16`
	COMMENTS	`"Primitive" means that x and y are positive and mutually prime.`
	EXAMPLE	`E.g. a(16)=2 because 65 = 8^2+1^2 = 7^2+4^2. a(11)=0 because although 45=6^2+3^2, 6 and 3 are not mutually prime. a(2)=0 because although 9=3^2+0^2, 0 is not positive.`
	CROSSREFS	`Cf. A106602.` `Sequence in context: A025895 A104451 A106602 * A143251 A115235 A160973` `Adjacent sequences: A106591 A106592 A106593 * A106595 A106596 A106597`
	KEYWORD	`easy,nonn`
	AUTHOR	`Colin Mallows (colinm(AT)avaya.com), May 10 2005`

Content is available under The OEIS End-User License Agreement .

Last modified February 17 03:45 EST 2012. Contains 205978 sequences.