id:A083025 - OEIS Search Results

Search: id:A083025

Displaying 1-1 of 1 results found.

page 1

Number of primes congruent to 1 modulo 4 dividing n (with multiplicity).

+0
14

0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 2, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 2, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 2, 0, 0, 1, 0, 1, 0, 0, 1, 1, 2, 0, 0, 1, 0, 1, 0, 1, 0, 0, 2, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 2, 1, 1, 0, 1, 1 (list; graph; listen)

	OFFSET	`1,25`
	REFERENCES	`D. Cox, "Primes of Form x^2 + n y^2", Wiley, 1989, p. 61.`
	LINKS	`T. D. Noe, Table of n, a(n) for n=1..10000`
	FORMULA	`a(n) = A001222(n) - A007814(n) - A065339(n).`
	CROSSREFS	`First differs from A046080 at n=65.` `Sequence in context: A155102 A015964 A088950 this_sequence A046080 A035227 A049340` `Adjacent sequences: A083022 A083023 A083024 this_sequence A083026 A083027 A083028`
	KEYWORD	`nonn,easy,nice`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 29 2001`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research