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 A125239 #14 Feb 11 2024 12:50:27 %S A125239 11,31,61,101,151,211,281,19,11,19,661,11,911,1051,1201,1361,1531,29, %T A125239 1901,11,2311,2531,11,3001,3251,3511,19,31,19,4651,11,5281,31,11,6301, %U A125239 6661,79,7411,29,59,79,11,9461,9901,11,19,29,19,12251,41,89,13781,11 %N A125239 Smallest prime divisor of 10*T(n)+1 = 5*n*(n+1)+1, where T(n) = 1 + 2 + ... + n. %C A125239 All divisors of 10*T(n)+1 are congruent to 1 or -1 modulo 10; that is, they end in the decimal digit 1 or 9. %H A125239 Harvey P. Dale, <a href="/A125239/b125239.txt">Table of n, a(n) for n = 1..1000</a> %H A125239 Nick Hobson, <a href="https://web.archive.org/web/20111019022839/http://www.qbyte.org/puzzles/p149s.html#triangular">Triangular Numbers</a>. %e A125239 10*T(9) + 1 = 5*9*10 + 1 = 451 = 11*41, so a(9) = 11. %t A125239 FactorInteger[#][[1,1]]&/@(10*Accumulate[Range[60]]+1) (* _Harvey P. Dale_, Dec 12 2011 *) %o A125239 (PARI) a(n) = if(n<1, 0, factor(5*n*(n+1)+1)[1,1]) %Y A125239 Cf. A000217, A062786, A090562, A124989. %K A125239 easy,nonn %O A125239 1,1 %A A125239 _Nick Hobson_, Nov 25 2006