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!)
A277879 Smallest prime r such that p = (q + r + 1)/r, where p = prime(n) and q = A277878(n). 1
2, 2, 2, 2, 2, 2, 3, 2, 3, 2, 2, 2, 2, 3, 2, 3, 3, 2, 2, 5, 3, 2, 3, 2, 2, 5, 2, 11, 2, 2, 3, 2, 19, 3, 3, 2, 5, 2, 5, 23, 2, 2, 2, 3, 3, 2, 2, 3, 3, 2, 11, 2, 2, 5, 2, 23, 3, 3, 3, 2, 5, 7, 2, 5, 2, 2, 7, 2, 13, 5, 5, 3, 2, 5, 11, 3, 3, 5, 3, 5, 2, 2, 2, 11, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET
2,1
COMMENTS
Rassias's conjecture is the claim that q and r exist for every p.
LINKS
PROG
(PARI) a(n) = my(t=prime(n)-1); forprime(r=2, oo, if(isprime(r*t-1), return(r))); \\ Jinyuan Wang, Jul 25 2021
CROSSREFS
Cf. A277878.
Sequence in context: A174273 A108128 A081326 * A257071 A332025 A212300
KEYWORD
nonn
AUTHOR
Felix Fröhlich, Nov 03 2016
EXTENSIONS
Terms corrected by and more terms from Jinyuan Wang, Jul 25 2021
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 12:15 EDT 2024. Contains 371969 sequences. (Running on oeis4.)