A039702 - OEIS

This site is supported by donations to The OEIS Foundation.

A039702

a(n) = n-th prime modulo 4.

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

	OFFSET	`1,1`
	COMMENTS	`Except for the first term, A100672(n) = (A039702(n)-1)/2 = parity of A005097. - Jeremy Gardiner (jeremy.gardiner(AT)btinternet.com), May 17 2008`
	LINKS	`Nathaniel Johnston, Table of n, a(n) for n = 1..10000`
	MAPLE	`seq(ithprime(n) mod 4, n=1..105); # Nathaniel Johnston, Jun 29 2011`
	MATHEMATICA	`Table[Mod[Prime[n], 4], {n, 105}] (* Nathaniel Johnston, Jun 29 2011 *)`
	CROSSREFS	`Cf. A039701, A039703-A039706, A100672, A005097, A038194, A007652, A039709-A039715.` `Sequence in context: A071282 A107796 A194308 * A104483 A080717 A200181` `Adjacent sequences: A039699 A039700 A039701 * A039703 A039704 A039705`
	KEYWORD	`nonn,easy`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

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

Last modified February 17 00:09 EST 2012. Contains 205978 sequences.