The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #12 Jan 03 2021 00:59:34
%S 27,39,105,279,629,597,1661,1875,3777,13961,15491,33585,87401,11445,
%T 28877,113451,265115,146189,584705,668525,1370667,1582581,1471865,
%U 2193351,2932901,3832635,3571617,3617721,15131459,31245831,11442269
%N a(n) is the least odd composite number m such that nextprime(p*m) > p*nextprime(m) where p is the n-th prime.
%C If k is prime then nextprime(k)=k.
%H Ray Chandler, <a href="/A117103/b117103.txt">Table of n, a(n) for n=1..32</a>
%e For n=1, p=2, the least odd composite m such that f(2*m) > 2*f(m) is 27=a(1).
%o (PARI) f(n)=nextprime(n); g(n,a)=for(i=1,a,if(f(n*i)>f(n)*f(i) && !isprime(i) && Mod(i,2)!=0,return(i))); forprime (i=1,150,print1(g(i,500000000), ","))
%K nonn
%O 1,1
%A Mohammed Bouayoun (mohammed.bouayoun(AT)sanef.com), Apr 18 2006
%E a(26)-a(30) from _Zak Seidov_, May 15 2007
%E a(31)-a(32) from _Ray Chandler_, May 30 2007