id:A039702 - OEIS Search Results

Search: id:A039702

Displaying 1-1 of 1 results found.

page 1

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

+0
10

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; listen)

	OFFSET	`1,1`
	COMMENT	`Except for the first term, A100672(n) = (A039702(n)-1)/2 = parity of A005097. - Jeremy Gardiner (jeremy.gardiner(AT)btinternet.com), May 17 2008`
	CROSSREFS	`Cf. A039701.` `Cf. A100672, A005097.` `Sequence in context: A099054 A071282 A107796 this_sequence A104483 A080717 A121062` `Adjacent sequences: A039699 A039700 A039701 this_sequence A039703 A039704 A039705`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified July 19 08:04 EDT 2008. Contains 142098 sequences.

AT&T Labs Research