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 A100481 #20 Feb 24 2023 10:00:40 %S A100481 1,3,5,3,2,3,11,3,13,7,2,17,19,5,7,11,3,5,3,7,29,5,2,11,17,7,3,37,13, %T A100481 5,7,43,11,5,23,47,7,5,17,13,3,11,19,29,59,5,31,7,2,13,11,67,23,7,71, %U A100481 3,73,37,19,11,79,5,3,41,83,7,43,29,11,89,13,23,47,19,3,97,7,11,101,17,103 %N A100481 Greatest prime factor in A095117(n). %C A100481 Conjecture: every prime appears infinitely often in this sequence. %F A100481 a(n) = A006530(n + A000720(n)). %o A100481 (PARI) gpf(n) = if (n==1, 1, vecmax(factor(n)[,1])); %o A100481 a(n) = gpf(n + primepi(n)); \\ _Michel Marcus_, Feb 24 2023 %Y A100481 Cf. A000720, A006530, A095117. %K A100481 easy,nonn,less %O A100481 1,2 %A A100481 _Jonathan Vos Post_, Nov 22 2004 %E A100481 Extended by _Ray Chandler_, Nov 27 2004