id:A039705 - OEIS Search Results

Search: id:A039705

Displaying 1-1 of 1 results found.

page 1

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

+0
6

2, 3, 5, 0, 4, 6, 3, 5, 2, 1, 3, 2, 6, 1, 5, 4, 3, 5, 4, 1, 3, 2, 6, 5, 6, 3, 5, 2, 4, 1, 1, 5, 4, 6, 2, 4, 3, 2, 6, 5, 4, 6, 2, 4, 1, 3, 1, 6, 3, 5, 2, 1, 3, 6, 5, 4, 3, 5, 4, 1, 3, 6, 6, 3, 5, 2, 2, 1, 4, 6, 3, 2, 3, 2, 1, 5, 4, 5, 2, 3, 6, 1, 4, 6, 5, 2, 1, 2, 6, 1 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`a(A049084(A045370(n-1))) = even; a(A049084(A045415(n-1))) = odd. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Feb 25 2008`
	LINKS	`R. Zumkeller, Table of n, a(n) for n = 1..1000`
	CROSSREFS	`Cf. A039703, A039709.` `Sequence in context: A144804 A118308 A068909 this_sequence A082118 A079344 A096535` `Adjacent sequences: A039702 A039703 A039704 this_sequence A039706 A039707 A039708`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified December 20 16:54 EST 2009. Contains 171081 sequences.

AT&T Labs Research