id:A065293 - OEIS Search Results

Search: id:A065293

Displaying 1-1 of 1 results found.

page 1

Number of values of s, 0 <= s <= n-1, such that 2^s mod n = s.

+0
2

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

	OFFSET	`1,21`
	EXAMPLE	`For n=5 we have (2^0) mod 5 = 1, (2^1) mod 5 = 2, (2^2) mod 5 = 4, (2^3) mod 5 = 3, (2^4) mod 5 = 1. Only for s=3 does (2^s) mod 5=s, so a(5)=1`
	CROSSREFS	`Cf. A065294.` `Sequence in context: A025888 A138532 A145708 this_sequence A054876 A109502 A112983` `Adjacent sequences: A065290 A065291 A065292 this_sequence A065294 A065295 A065296`
	KEYWORD	`nonn`
	AUTHOR	`Jonathan Ayres (jonathan.ayres(AT)btinternet.com), Oct 28 2001`

page 1

Search completed in 0.002 seconds

Last modified November 30 22:12 EST 2008. Contains 150989 sequences.

AT&T Labs Research