login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A069808 Smallest k>n such that prime(n)-1 divides prime(k)-1. 1
2, 3, 6, 6, 11, 12, 25, 12, 19, 30, 18, 21, 53, 31, 34, 37, 51, 42, 46, 47, 84, 37, 131, 71, 44, 79, 63, 132, 84, 68, 75, 98, 80, 59, 108, 110, 65, 93, 95, 174, 180, 100, 105, 106, 220, 78, 82, 275, 250, 88, 158, 162, 197, 133, 136, 138, 254, 100, 145, 369, 189, 151 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
MATHEMATICA
sk[n_]:=Module[{k=n+1, p=Prime[n]-1}, While[Mod[Prime[k]-1, p]!=0, k++]; k]; Array[sk, 70] (* Harvey P. Dale, Oct 10 2021 *)
PROG
(PARI) for(s=1, 100, n=s+1; while(frac((prime(n)-1)/(prime(s)-1))>0, n++); print1(n, ", "); )
CROSSREFS
Sequence in context: A155215 A363075 A119319 * A131259 A346758 A143177
KEYWORD
easy,nonn
AUTHOR
Benoit Cloitre, May 01 2002
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 03:15 EDT 2024. Contains 371964 sequences. (Running on oeis4.)