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 A342310 #13 Jan 28 2025 15:16:22 %S A342310 15493,18637,43613,45179,61333,67807,68483,80671,87383,120557,130349, %T A342310 138077,139187,199373,341027,485201,581869,598079,776497,786931, %U A342310 790063,869777,936709,943013,964303,1085737,1166153,1187999,1192207,1225517,1363837,1392959,1404419 %N A342310 Prime Erdős-Woods numbers. %C A342310 A number k is an Erdős-Woods number (A059756) if there exists m such that for every 0 <= i <= m, at least one of gcd(m+i, m) > 1 or gcd(m+i, m+k) > 1 holds. This sequence gives the prime terms in A059756. %H A342310 Bertram Felgenhauer, <a href="http://www.int-e.eu/oeis/">Some OEIS computations</a> (includes the terms of this sequence up to 100000). %H A342310 Jinyuan Wang, <a href="/A342310/a342310.cpp.txt">C++ program</a>. %H A342310 Wikipedia, <a href="https://en.wikipedia.org/wiki/Erd%C5%91s%E2%80%93Woods_number">Erdős-Woods number</a>. %Y A342310 Subsequence of A059756 and A111042. %K A342310 nonn,hard %O A342310 1,1 %A A342310 _Jianing Song_, Mar 08 2021 %E A342310 More terms from _Jinyuan Wang_, Jan 28 2025