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!)
A069807 Smallest k>n such that prime(n)+1 divides prime(k)+1. 0
3, 4, 5, 9, 9, 13, 16, 17, 15, 17, 31, 30, 23, 32, 43, 28, 41, 84, 58, 72, 86, 52, 39, 41, 62, 97, 64, 83, 85, 49, 76, 56, 144, 81, 87, 111, 115, 94, 96, 69, 72, 129, 76, 192, 108, 109, 235, 247, 124, 157, 91, 92, 163, 96, 137, 215, 140, 181, 262, 103, 300, 107, 202, 246 (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, Nov 13 2022 *)
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: A036710 A098801 A259615 * A132141 A246303 A362461
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 February 27 16:21 EST 2024. Contains 370378 sequences. (Running on oeis4.)