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 A023576 #12 May 04 2021 01:57:57 %S A023576 5,3,2,5,7,2,5,11,13,2,17,5,11,23,5,7,31,2,7,37,19,41,43,23,5,13,53, %T A023576 11,7,29,13,67,7,71,19,11,5,83,17,11,13,23,97,7,5,101,107,113,23,29, %U A023576 59,11,61,127,13,19,17,137,7,71,13,37,31,157,79,5,167,17,7,11,89 %N A023576 Greatest prime divisor of prime(n)+3. %H A023576 Harvey P. Dale, <a href="/A023576/b023576.txt">Table of n, a(n) for n = 1..1000</a> %F A023576 a(n) = A006530(A113935(n)). - _Michel Marcus_, May 04 2021 %t A023576 FactorInteger[#][[-1, 1]] & /@ (Prime[Range[100]] + 3) (* _Harvey P. Dale_, Sep 05 2014 *) %o A023576 (Python) %o A023576 from sympy import primefactors, prime %o A023576 def a(n): return primefactors(prime(n) + 3)[-1] %o A023576 print([a(n) for n in range(1, 72)]) # _Michael S. Branicky_, May 03 2021 %Y A023576 Cf. A006530, A113935. %K A023576 nonn %O A023576 1,1 %A A023576 _Clark Kimberling_