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 A293958 #30 Jul 09 2025 04:46:11
%S A293958 5,13,5,41,61,5,113,5,181,13,5,313,5,421,13,5,613,5,761,29,5,1013,5,
%T A293958 1201,1301,5,17,5,1741,1861,5,2113,5,2381,2521,5,29,5,3121,17,5,3613,
%U A293958 5,17,41,5,4513,5,13,5101,5,37,5,13,61,5,17,5,73,7321,5,13,5,53,8581,5,13,5,9661,9941,5
%N A293958 Smallest odd prime divisor of (2n+1)^2 + 1.
%C A293958 If the map "x -> smallest odd prime divisor of n^2+1" is iterated, does it always terminate in the 2-cycle (5 <-> 13)? - _Zoran Sunic_, Oct 25 2017
%C A293958 A027862 is a subsequence. - _David A. Corneth_, Nov 04 2017
%H A293958 David A. Corneth, <a href="/A293958/b293958.txt">Table of n, a(n) for n = 1..10000</a>
%F A293958 a(n) = A078701(A069894(n)). - _Michel Marcus_, Nov 04 2017
%t A293958 sod[n_]:=With[{fi=FactorInteger[n]},If[fi[[1,1]]==2,fi[[2,1]],fi[1,1]]]; sod/@(Range[3,151,2]^2+1) (* _Harvey P. Dale_, Dec 23 2023 *)
%o A293958 (PARI) a(n) = factor((2*n+1)^2 + 1)[2,1]; \\ _Michel Marcus_, Nov 04 2017
%Y A293958 A bisection of A125256. Cf. A027862, A069894, A078701, A256970.
%K A293958 nonn
%O A293958 1,1
%A A293958 _N. J. A. Sloane_, Nov 04 2017, following a suggestion from _Zoran Sunic_