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 A117365 #15 Sep 16 2017 22:36:57
%S A117365 1,1,2,1,3,1,5,1,2,1,7,1,11,1,2,1,13,1,17,1,2,1,19,1,3,1,2,1,23,1,29,
%T A117365 1,2,1,3,1,31,1,2,1,37,1,41,1,2,1,43,1,5,1,2,1,47,1,3,1,2,1,53,1,59,1,
%U A117365 2,1,3,1,61,1,2,1,67,1,71,1,2,1,5,1,73,1,2,1,79,1,3,1,2,1,83,1,5,1,2,1,3,1
%N A117365 a(n) = largest prime less than the smallest prime dividing n (or 1 if there is no such prime).
%C A117365 a(n) = 1 if and only if n is even or if n = 1.
%H A117365 Michael De Vlieger, <a href="/A117365/b117365.txt">Table of n, a(n) for n = 1..10000</a>
%e A117365 5 is the smallest prime dividing 35. So a(35) is the largest prime < 5, which is 3.
%t A117365 a[n_] := If[EvenQ[n], 1, Prime[PrimePi[FactorInteger[n][[1]][[1]]] - 1]]; Table[a[n], {n, 2, 80}] (* _Stefan Steinerberger_, Mar 14 2006 *)
%t A117365 Table[NextPrime[FactorInteger[n][[1, 1]], -1] /. -2 -> 1, {n, 96}] (* _Michael De Vlieger_, Sep 16 2017 *)
%Y A117365 Cf. A117364, A117366, A117367, A117368.
%K A117365 nonn
%O A117365 1,3
%A A117365 _Leroy Quet_, Mar 10 2006
%E A117365 More terms from _Stefan Steinerberger_, Mar 14 2006
%E A117365 More terms from _Franklin T. Adams-Watters_, Aug 29 2006