OFFSET
1,1
COMMENTS
If m were an odd number, k*m/(k+m) would never be prime for all k; these are trivial and are not included. See A242932.
It is believed that numbers in A016742 (except 4) are members of this sequence.
This is true (see Fried link). - Sela Fried, Mar 23 2026
LINKS
Sela Fried, Proof of a conjecture stated in A242933, 2026.
EXAMPLE
16*k/(16+k) is an integer for k = 16, 48, 112, and 240. These k-values give the integers 8, 12, 14, and 15, respectively. Since none are prime, 16 is a member of this sequence.
PROG
(PARI) f(n)=for(k=1, n*(n-1), s=(k*n)/(k+n); if(floor(s)==s, if(ispseudoprime(s), return(k)))) \\ A242834
n=1; while(n<300, if(f(2*n)==0, print1(2*n, ", ")); n+=1)
CROSSREFS
KEYWORD
nonn
AUTHOR
Derek Orr, May 27 2014
EXTENSIONS
Name clarified by Michel Marcus, Mar 23 2026
STATUS
approved
