id:A118917 - OEIS Search Results

Search: id:A118917

Displaying 1-1 of 1 results found.

page 1

Number of inequivalent primes in ring of integers Z[sqrt(2)] with absolute value of norm = n.

+0
3

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

	OFFSET	`0,8`
	COMMENT	`Since there are infinitely many units in Z[sqrt(2)], the total number of primes with a given norm is infinite (when there are any).`
	FORMULA	`a(n) = 2 if n is a prime = 1,7 (mod 8); a(n) = 1 if n is 2 or p^2 where p is a prime = 3,5 (mod 8); otherwise a(n) = 0.`
	CROSSREFS	`Cf. A055029, A118916.` `Sequence in context: A138954 A064530 A037047 this_sequence A045827 A070103 A113048` `Adjacent sequences: A118914 A118915 A118916 this_sequence A118918 A118919 A118920`
	KEYWORD	`easy,nice,nonn`
	AUTHOR	`Frank Adams-Watters (FrankTAW(AT)Netscape.net), May 05 2006`

page 1

Search completed in 0.002 seconds

Last modified November 18 20:14 EST 2008. Contains 147244 sequences.

AT&T Labs Research