id:A039701 - OEIS Search Results

Search: id:A039701

Displaying 1-1 of 1 results found.

page 1

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

+0
7

2, 0, 2, 1, 2, 1, 2, 1, 2, 2, 1, 1, 2, 1, 2, 2, 2, 1, 1, 2, 1, 1, 2, 2, 1, 2, 1, 2, 1, 2, 1, 2, 2, 1, 2, 1, 1, 1, 2, 2, 2, 1, 2, 1, 2, 1, 1, 1, 2, 1, 2, 2, 1, 2, 2, 2, 2, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 1, 2, 1, 2, 2, 1, 1, 1, 2, 2, 1, 2, 1, 2, 1, 2, 1, 1, 2, 2, 1, 2, 1 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`If n>2 and prime(n) is a Mersenne prime then a(n)=1. Proof: prime(n) = 2^p-1 for some odd prime p, so prime(n) = 24^((p-1)/2) - 1 == 2-1 = 1 (mod 3). - Santi Spadaro (spados(AT)katamail.com), May 03 2002; corrected and simplified by Dean Hickerson (dean.hickerson(AT)yahoo.com), Apr 20 2003` `Except for n=2, a(n) is the smallest number k > 0 such that 3 divides prime(n)^k - 1. - T. D. Noe (noe(AT)sspectra.com), Apr 17 2003` `a(n) <> 0 for n <> 2; a(A049084(A003627(n)))=2; a(A049084(A002476(n)))=1; A134323(n) = (1 - 0^a(n)) (-1)^(a(n)+1). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 21 2007`
	MATHEMATICA	`Table[Mod[Prime[n], 3], {n, 10000}]`
	CROSSREFS	`Cf. A039702.` `Sequence in context: A165414 A117929 A107455 this_sequence A025822 A051585 A049115` `Adjacent sequences: A039698 A039699 A039700 this_sequence A039702 A039703 A039704`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research