This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A082463 #10 Dec 23 2024 21:49:32 %S A082463 1,2,3,4,5,6,7,9,10 %N A082463 Numbers k such that A072181(k) + 1 is prime. %C A082463 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 A082463 a(10), if it exists, is greater than 66. - _Michael S. Branicky_, Dec 23 2024 %o A082463 (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 A082463 for(n=1,1e4,k=stepA072181(k,n); if(ispseudoprime(k+1),print1(n", "))) \\ _Charles R Greathouse IV_, Oct 16 2015 %Y A082463 Cf. A072181, A082464. %K A082463 hard,more,nonn %O A082463 1,2 %A A082463 _Naohiro Nomoto_, Apr 26 2003