A039704 - OEIS

This site is supported by donations to The OEIS Foundation.

A039704

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

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

	OFFSET	`1,1`
	LINKS	`Nathaniel Johnston, Table of n, a(n) for n = 1..10000`
	MAPLE	`seq(ithprime(n) mod 6, n=1..105); # Nathaniel Johnston, Jun 29 2011`
	MATHEMATICA	`Table[Mod[Prime[n], 6], {n, 105}] (* Nathaniel Johnston, Jun 29 2011 *)`
	CROSSREFS	`Cf. A039701-A039703, A039705, A039706, A038194, A007652, A039709-A039715.` `Sequence in context: A110879 A016587 A123217 * A002752 A128047 A105870` `Adjacent sequences: A039701 A039702 A039703 * A039705 A039706 A039707`
	KEYWORD	`nonn,easy`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

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

Last modified February 17 04:46 EST 2012. Contains 205985 sequences.