id:A095925 - OEIS Search Results

Search: id:A095925

Displaying 1-1 of 1 results found.

page 1

Smallest m such that prime(n) mod m > 1.

+0
1

3, 4, 3, 4, 3, 5, 3, 4, 3, 3, 4, 5, 3, 4, 3, 3, 3, 7, 4, 3, 5, 4, 3, 3, 5, 3, 4, 3, 5, 3, 4, 3, 3, 4, 3, 4, 5, 4, 3, 3, 3, 7, 3, 5, 3, 4, 4, 4, 3, 5, 3, 3, 7, 3, 3, 3, 3, 4, 5, 3, 4, 3, 4, 3, 5, 3, 4, 5, 3, 5, 3, 3, 4, 5, 4, 3, 3, 5, 3, 5, 3, 8, 3, 5, 4, 3, 3, 5, 3, 4, 3, 3, 4, 3, 4, 3, 3, 3, 4, 7, 4, 3 (list; graph; listen)

	OFFSET	`1,1`
	EXAMPLE	`A000040(25)=97: 97 mod 1 = 0, 97 mod 2 = 1, 97 mod 3 = 1, 97` `mod 4 = 1, but 97 mod 5 = 2>1, therefore a(25)=5.`
	CROSSREFS	`Sequence in context: A102745 A108026 A010702 this_sequence A066783 A046536 A052384` `Adjacent sequences: A095922 A095923 A095924 this_sequence A095926 A095927 A095928`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jul 12 2004`

page 1

Search completed in 0.004 seconds

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

AT&T Labs Research