id:A058910 - OEIS Search Results

Search: id:A058910

Displaying 1-1 of 1 results found.

page 1

Smallest prime number, not already in sequence, such that the product M of it and all prior numbers in sequence satisfies 2^(M+1) = 1 (mod M).

+0
1

3, 5, 17, 257, 641, 1217, 14593, 167809, 671233, 1314497, 180449537, 424050817 (list; graph; listen)

	OFFSET	`0,1`
	EXAMPLE	`a(3)=17 because n=3517=255 and 2^256 = 1 (mod 255)`
	CROSSREFS	`Sequence in context: A107312 A083213 A056826 this_sequence A023394 A056130 A078726` `Adjacent sequences: A058907 A058908 A058909 this_sequence A058911 A058912 A058913`
	KEYWORD	`nonn`
	AUTHOR	`Joe K. Crump (joecr(AT)carolina.rr.com), Jan 09 2001`

page 1

Search completed in 0.002 seconds

Last modified December 5 08:23 EST 2009. Contains 170348 sequences.