login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A095925 Smallest m such that prime(n) mod m > 1. 0
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; refs; listen; history; internal format)
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 * A066783 A046536 A052384

Adjacent sequences:  A095922 A095923 A095924 * A095926 A095927 A095928

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jul 12 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 13 21:59 EST 2012. Contains 205562 sequences.