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 A364564 #9 Jul 29 2023 15:59:22 %S A364564 1,3,5,3,5,7,5,3,7,5,7,11,7,5,11,3,13,11,7,11,5,5,13,7,11,13,7,17,7, %T A364564 13,17,5,11,3,7,13,11,17,11,7,19,13,7,13,17,11,5,11,5,17,13,7,13,11, %U A364564 13,7,11,17,7,13,17,11,5,19,13,17,19,5,11,13,3,7,19,17,13,11,17,13,11,17,7,11,19,17,7,19,13,13 %N A364564 Largest prime factor computed for those odd numbers k for which A156552(k) < k. %C A364564 These primes must stay reasonably small, but how small? %C A364564 See also the example section of A364551. %H A364564 Antti Karttunen, <a href="/A364564/b364564.txt">Table of n, a(n) for n = 1..13739</a> %F A364564 a(n) = A006530(A364561(n)). %Y A364564 Cf. A006530, A156552, A364551, A364561. %K A364564 nonn %O A364564 1,2 %A A364564 _Antti Karttunen_, Jul 28 2023