Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #10 Dec 23 2024 21:49:32
%S 1,2,3,4,5,6,7,9,10
%N Numbers k such that A072181(k) + 1 is prime.
%C a(10), if it exists, is greater than 47; any corresponding primes would have more than 40,000 decimal digits. - _Charles R Greathouse IV_, Oct 16 2015
%C a(10), if it exists, is greater than 66. - _Michael S. Branicky_, Dec 23 2024
%o (PARI) stepA072181(k,n)=if(n<3, return(n)); my(f=factor(k), g=factor(n), p=Set(concat(f[,1],g[,1])), x=((f,p) -> my(i=setsearch(f[,1]~,p)); if(i,f[i,2],1)), e=apply(q->x(f,q)*x(g,q),p)); factorback(concat(Mat(p~),e~))
%o for(n=1,1e4,k=stepA072181(k,n); if(ispseudoprime(k+1),print1(n", "))) \\ _Charles R Greathouse IV_, Oct 16 2015
%Y Cf. A072181, A082464.
%K hard,more,nonn,changed
%O 1,2
%A _Naohiro Nomoto_, Apr 26 2003