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 A083955 #8 Mar 02 2023 17:44:39
%S A083955 3557,12038,14810,15424,28456,30742,31540,37665,45602,46883,47879,
%T A083955 48152,52196,52617,55265,57902,68306,69032,74925,76262,79562,79984,
%U A083955 84569,90442,104867,104956,107213,112570,114614,119477,127634,131072,132466
%N A083955 Numbers n > 1 such that n^5 - 2 has no prime factor > n.
%C A083955 Also integers n > 1 for which there is no prime p > n such that x = n is a solution mod p of x^5 = 2, since the following equivalences hold for n > 1: There is a prime p > n such that n is a solution mod p of x^5 = 2 iff n^5 - 2 has a prime factor > n; n is a solution mod p of x^5 = 2 iff p is a prime factor of n^5 - 2 and p > n.
%e A083955 12038 is a term since 12038^5 - 2 = 252796871460867395166 = 2*3*3*3*263*571*641*911*5849*9127 has no prime factor > 12038.
%t A083955 t = {}; Do[If[Max[First/@FactorInteger[n^5-2]]<n,AppendTo[t,n]],{n,2,5*10^4}]; t (* _Jayanta Basu_, May 20 2013 *)
%t A083955 Select[Range[2,133000],Max[FactorInteger[#^5-2][[;;,1]]]<=#&] (* _Harvey P. Dale_, Mar 02 2023 *)
%o A083955 (PARI) {for(n=2,133000,f=factor(n^5-2); if(f[matsize(f)[1],1]<=n,print1(n,",")))}
%Y A083955 Cf. A040159, A040160, A065903.
%K A083955 nonn
%O A083955 1,1
%A A083955 _Klaus Brockhaus_, May 09 2003