A039705 - OEIS

This site is supported by donations to The OEIS Foundation.

A039705

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

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, 5, 3, 4, 1, 2, 6, 5, 3, 5, 2, 1, 4, 3, 2, 4 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,1`
	COMMENTS	`a(A049084(A045370(n-1))) is even; a(A049084(A045415(n-1))) is odd. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Feb 25 2008`
	LINKS	`R. Zumkeller, Table of n, a(n) for n = 1..1000`
	MAPLE	`seq(ithprime(n) mod 7, n=1..105); # Nathaniel Johnston, Jun 29 2011`
	MATHEMATICA	`Table[Mod[Prime[n], 7], {n, 105}] (* Nathaniel Johnston, Jun 29 2011 *)`
	CROSSREFS	`Cf. A039701-A039704, A039706, A038194, A007652, A039709-A039715.` `Sequence in context: A118308 A174548 A068909 * A082118 A079344 A096535` `Adjacent sequences: A039702 A039703 A039704 * A039706 A039707 A039708`
	KEYWORD	`nonn,easy`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

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

Last modified February 16 21:04 EST 2012. Contains 205969 sequences.