login
This site is supported by donations to The OEIS Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

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, 281, 2, 3, 2, 23 (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

Table of n, a(n) for n=2..7.

Wikipedia, Rassias' conjecture.

PROG

(PARI) findr(n) = my(q=3); while(1, forprime(r=1, q-1, if(n==(q+r+1)/r, return(r)); q=nextprime(q+1)))

a(n) = findr(prime(n))

CROSSREFS

Cf. A277878.

Sequence in context: A231041 A080296 A260331 * A182519 A279450 A163276

Adjacent sequences:  A277876 A277877 A277878 * A277880 A277881 A277882

KEYWORD

nonn,more

AUTHOR

Felix Fröhlich, Nov 03 2016

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 20 03:32 EST 2019. Contains 319323 sequences. (Running on oeis4.)