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 A064917 #14 Jun 19 2018 05:14:56
%S A064917 2,3,3,5,3,7,5,5,3,11,7,13,5,7,5,17,3,19,11,5,7,23,13,5,5,11,7,29,5,
%T A064917 31,17,13,3,11,19,37,11,7,5,41,7,43,23,17,13,47,5,13,5,19,11,53,7,7,
%U A064917 29,5,5,59,31,61,17,23,13,17,3,67,11,5,19,71,37,73,11,11,7,17,5,79,41,29,7
%N A064917 a(n) is the result of beginning with n and iterating k -> A064916(k) until a prime is reached.
%C A064917 Well-defined since A064916(n) < n for nonprimes.
%C A064917 a(p) = p for all primes p.
%H A064917 Harry J. Smith, <a href="/A064917/b064917.txt">Table of n, a(n) for n = 2..1000</a>
%H A064917 Michael Gilleland, <a href="/selfsimilar.html">Some Self-Similar Integer Sequences</a>
%e A064917 a(6) = 3 as A064916(6) = 4 and A064916(4) = 3.
%o A064917 (PARI) lpf(n)= { local(f); f=factor(n); return(f[1, 1]) } { for (n=2, 1000, m=n; while (!isprime(m), L=lpf(m); m=m / L + L - 1); write("b064917.txt", n, " ", m) ) } \\ _Harry J. Smith_, Sep 29 2009
%Y A064917 Cf. A064916, A064918, A064921.
%K A064917 nonn
%O A064917 2,1
%A A064917 _Reinhard Zumkeller_, Oct 14 2001