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

%I #14 Jul 26 2021 04:51:07

%S 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,

%T 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,

%U 7,2,13,5,5,3,2,5,11,3,3,5,3,5,2,2,2,11,2

%N Smallest prime r such that p = (q + r + 1)/r, where p = prime(n) and q = A277878(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))); \\ _Jinyuan Wang_, Jul 25 2021

%Y Cf. A277878.

%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 April 18 22:18 EDT 2024. Contains 371782 sequences. (Running on oeis4.)