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!)
A034913 Odd primes p such that q = (k*p+1)/(p-k) is prime for some p/2 < k < p. 2
3, 7, 13, 17, 23, 31, 47, 53, 67, 73, 79, 113, 137, 139, 151, 157, 163, 173, 193, 227, 257, 293, 307, 317, 337, 349, 353, 379, 401, 419, 457, 463, 467, 479, 487, 499, 541, 557, 577, 593, 599, 613, 617, 643, 653, 677, 691, 727, 733, 769, 787, 811, 829, 853 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Related to hyperperfect numbers of a certain form.
Old name was: Primes such that q=(k*a(n)+1)/(a(n)-k), is prime for some k, q>a(n).
LINKS
Charles R Greathouse IV, Table of n, a(n) for n = 1..10000
J. S. McCranie, A study of hyperperfect numbers, J. Int. Seqs. Vol. 3 (2000) #P00.1.3.
EXAMPLE
137 is a term since (132*137+1)/(137-132) = 3617 is prime.
PROG
(PARI) isok(p)=for (k=1, p-1, my(q = (k*p+1)/(p-k)); if ((q > p) && (denominator(q)==1) && isprime(q), return (1)); );
lista(nn) = forprime(p=3, nn, if (isok(p), print1(p, ", "))) \\ Michel Marcus, Mar 11 2016
(PARI) is(p)=fordiv(p^2+1, d, if(d>=p/2, return(0)); if(isprime((p*(p-d)+1)/d), return(isprime(p)))) \\ Charles R Greathouse IV, Mar 11 2016
CROSSREFS
Cf. A034914.
Sequence in context: A040106 A191028 A034914 * A040148 A097957 A071774
KEYWORD
nonn
AUTHOR
EXTENSIONS
Name edited by Michel Marcus and Charles R Greathouse IV, Mar 11 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 7 18:53 EDT 2024. Contains 373206 sequences. (Running on oeis4.)