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 A349722 #24 Dec 06 2021 03:13:20 %S A349722 2243399,2334547,2743723,3932207,4623107,4716343,5482423,5993411, %T A349722 6490151,7156769,7187743,8795167,9026987,9608843,9923209 %N A349722 Primes p such that the greatest common divisor of 2^p+1 and 3^p+1 is composite. %H A349722 Carlos Rivera, <a href="https://www.primepuzzles.net/puzzles/puzz_1064.htm">Puzzle 1064. GCD(2^p+1,3^p+1)</a>, The Prime Puzzles and Problems Connection. %o A349722 (PARI) isok(p) = if (isprime(p), my(g=gcd(2^p+1, 3^p+1)); (g>1) && !isprime(g)); %Y A349722 Subsequence of A260674. %Y A349722 Cf. A066803. %K A349722 nonn,more %O A349722 1,1 %A A349722 _Michel Marcus_, Nov 27 2021 %E A349722 a(4)-a(7) after update of Rivera link from _Martin Ehrenstein_, Dec 04 2021 %E A349722 a(8)-a(9) from _Shyam Sunder Gupta_, Dec 04 2021 %E A349722 a(10)-a(15) from _Martin Ehrenstein_, Dec 05 2021