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 A073501 #21 Sep 08 2022 08:45:06 %S A073501 7,41,43,47,73,83,157,173,191,193,211,233,239,251,293,307,313,337,401, %T A073501 421,431,443,463,467,499,509,557,577,593,599,601,659,701,743,757,787, %U A073501 811,829,853,857,863,911,919,1087,1109,1123,1223,1229,1277,1297,1301 %N A073501 Primes p such that the largest prime factor of p^2+1 is less than p. %C A073501 Primes p such that the largest prime factor of p+1 is less than p gives A065091, odd primes. %H A073501 Robert Israel, <a href="/A073501/b073501.txt">Table of n, a(n) for n = 1..10000</a> %p A073501 filter:= proc(n) max(numtheory:-factorset(n^2+1))<n end proc: %p A073501 select(filter, [seq(ithprime(i),i=1..1000)]); # _Robert Israel_, Aug 07 2019 %t A073501 <<NumberTheory`NumberTheoryFunctions` Select[Prime[Range[250]], Max[PrimeFactorList[1 + #^2]] < # &] (* _Ray Chandler_, Jan 08 2005 *) %t A073501 Select[Prime[Range[212]], Max[First /@ FactorInteger[#^2 + 1]] < # &] (* _Jayanta Basu_, Jul 01 2013 *) %o A073501 (Magma) [p:p in PrimesUpTo(1500)|Max(PrimeDivisors(p^2+1)) lt p]; // _Marius A. Burtea_, Aug 07 2019 %Y A073501 Cf. A065091, A073501, A256011. %K A073501 easy,nonn %O A073501 1,1 %A A073501 _Benoit Cloitre_, Aug 27 2002