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 A248553 #10 Oct 01 2024 15:51:22
%S A248553 10,414,596,1000,1020,1606,1626,2030,2414,2434,2616,3444,3626,3646,
%T A248553 4030,5040,5060,5646,5666,6070,6454,6474,6656,6676,7060,7464,7666,
%U A248553 7686,8070,8090,8474,8696,9080,9504,10090,10494,10696,10716,11504,11706,12534,12716,12736
%N A248553 Numbers n such that the smallest prime divisor of n^2+1 is 101.
%C A248553 Or numbers n such that the smallest prime divisor of n^2+1 is A002313(13).
%C A248553 a(n)== 10 or 192 (mod 202).
%H A248553 Amiram Eldar, <a href="/A248553/b248553.txt">Table of n, a(n) for n = 1..10000</a>
%e A248553 414 is in the sequence because 414^2+1= 101*1697.
%t A248553 lst={};Do[If[FactorInteger[n^2+1][[1, 1]]==101, AppendTo[lst, n]], {n, 2, 10000}]; lst
%t A248553 p = 101; ps = Select[Range[p - 1], Mod[#, 4] != 3 && PrimeQ[#] &]; Select[Range[13000], Divisible[(nn = #^2 + 1), p] && ! Or @@ Divisible[nn, ps] &] (* _Amiram Eldar_, Aug 16 2019 *)
%t A248553 Select[Range[13000],FactorInteger[#^2+1][[1,1]]==101&] (* _Harvey P. Dale_, Oct 01 2024 *)
%Y A248553 Cf. A089120, A002313, A209874, A248527-A248531, A248549-A248553.
%K A248553 nonn,easy
%O A248553 1,1
%A A248553 _Michel Lagneau_, Oct 08 2014