id:A062173 - OEIS Search Results

Search: id:A062173

Displaying 1-1 of 1 results found.

page 1

2^(n-1) mod n.

+0
5

0, 0, 1, 0, 1, 2, 1, 0, 4, 2, 1, 8, 1, 2, 4, 0, 1, 14, 1, 8, 4, 2, 1, 8, 16, 2, 13, 8, 1, 2, 1, 0, 4, 2, 9, 32, 1, 2, 4, 8, 1, 32, 1, 8, 31, 2, 1, 32, 15, 12, 4, 8, 1, 14, 49, 16, 4, 2, 1, 8, 1, 2, 4, 0, 16, 32, 1, 8, 4, 22, 1, 32, 1, 2, 34, 8, 9, 32, 1, 48, 40, 2, 1, 32, 16, 2, 4, 40, 1, 32, 64 (list; graph; listen)

	OFFSET	`1,6`
	COMMENT	`If p is an odd prime then a(p)=1. However, a(n) is also 1 for pseudoprimes to base 2 such as 341.`
	LINKS	`Harry J. Smith, Table of n, a(n) for n=1,...,1000` `Index entries for sequences related to pseudoprimes`
	EXAMPLE	`a(5) = 2^(5-1) mod 5 = 16 mod 5 = 1.`
	PROGRAM	`(PARI) { for (n=1, 1000, write("b062173.txt", n, " ", 2^(n - 1)%n) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Aug 02 2009]`
	CROSSREFS	`Cf. A001567, A015919, A062172.` `Sequence in context: A062296 A140649 A091453 this_sequence A004558 A129699 A002349` `Adjacent sequences: A062170 A062171 A062172 this_sequence A062174 A062175 A062176`
	KEYWORD	`nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Jun 12 2001`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research