The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A277878 Smallest prime q with q > r such that p = (q + r + 1)/r, where p = prime(n) and r = A277879(n). 1

%I #17 Jul 26 2021 04:49:38

%S 3,7,11,19,23,31,53,43,83,59,71,79,83,137,103,173,179,131,139,359,233,

%T 163,263,191,199,509,211,1187,223,251,389,271,2621,443,449,311,809,

%U 331,859,4093,359,379,383,587,593,419,443,677,683,463,2617,479,499,1279

%N Smallest prime q with q > r such that p = (q + r + 1)/r, where p = prime(n) and r = A277879(n).

%C Rassias's conjecture is the claim that q and r exist for every p.

%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Rassias%27_conjecture">Rassias' conjecture</a>.

%o (PARI) a(n) = my(t=prime(n)-1); forprime(r=2, oo, if(isprime(r*t-1), return(r*t-1))); \\ _Jinyuan Wang_, Jul 25 2021

%Y Cf. A277879.

%K nonn

%O 2,1

%A _Felix Fröhlich_, Nov 03 2016

%E Terms corrected by and more terms from _Jinyuan Wang_, Jul 25 2021

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 June 6 15:44 EDT 2024. Contains 373132 sequences. (Running on oeis4.)