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 A014673 #38 Jul 27 2019 00:40:23
%S A014673 1,1,1,2,1,3,1,2,3,5,1,2,1,7,5,2,1,3,1,2,7,11,1,2,5,13,3,2,1,3,1,2,11,
%T A014673 17,7,2,1,19,13,2,1,3,1,2,3,23,1,2,7,5,17,2,1,3,11,2,19,29,1,2,1,31,3,
%U A014673 2,13,3,1,2,23,5,1,2,1,37,5,2,11,3,1,2,3,41,1,2,17,43,29,2,1,3,13,2,31,47
%N A014673 Smallest prime factor of greatest proper divisor of n.
%C A014673 For n > 1: a(n) = 1 iff n is prime; a(A001358(n)) = A084127(n); a(A025475(n)) = A020639(A025475(n)). [corrected by _Peter Munn_, Feb 19 2017]
%C A014673 When n is composite, this is the 2nd factor when n is written as a product of primes in nondecreasing order. For example, 12 = 2*2*3, so a(12) = 2. - _Peter Munn_, Feb 19 2017
%C A014673 For all sufficiently large n the median value of a(1), a(2), ... a(n) is A281889(2) = 7. - _Peter Munn_, Jul 12 2019
%H A014673 Antti Karttunen, <a href="/A014673/b014673.txt">Table of n, a(n) for n = 1..10000</a>
%F A014673 a(n) = A020639(A032742(n)).
%F A014673 A117357(n) = A020639(A054576(n)); A117358(n) = A032742(A054576(n)) = A054576(n)/A117357(n). - _Reinhard Zumkeller_, Mar 10 2006
%F A014673 If A001222(n) >= 2, a(n) = A027746(n,2), otherwise a(n) = 1. - _Peter Munn_, Jul 13 2019
%t A014673 PrimeFactors[ n_ ] := Flatten[ Table[ # [ [ 1 ] ], {1} ] & /@ FactorInteger[ n ] ]; f[ n_ ] := Block[ {gpd = Divisors[ n ][ [ -2 ] ]}, If[ gpd == 1, 1, PrimeFactors[ gpd ][ [ 1 ] ] ] ]; Table[ If[ n == 1, 1, f[ n ] ], {n, 1, 95} ]
%t A014673 (* Second program: *)
%t A014673 Table[If[Or[PrimeQ@ n, n == 1], 1, FactorInteger[n/SelectFirst[Prime@ Range@ PrimePi[Sqrt@ n], Divisible[n, #] &]][[1, 1]] ], {n, 94}] (* _Michael De Vlieger_, Aug 14 2017 *)
%o A014673 (PARI) lpf(n)=if(n>1,factor(n)[1,1],1)
%o A014673 a(n)=lpf(n/lpf(n)) \\ _Charles R Greathouse IV_, May 09 2013
%o A014673 (PARI) a(n)=if(n<4||isprime(n),return(1)); my(f=factor(n)); if(f[1,2]>1, f[1,1], f[2,1]) \\ _Charles R Greathouse IV_, May 09 2013
%o A014673 (Scheme) (define (A014673 n) (A020639 (/ n (A020639 n)))) ;; Code for A020639 given under that entry - _Antti Karttunen_, Aug 12 2017
%Y A014673 Cf. A001222, A001358, A020639, A025475, A027746, A032742, A054576, A084127, A085392, A085393, A115561, A117357, A117358, A281889.
%K A014673 nonn
%O A014673 1,4
%A A014673 _Reinhard Zumkeller_, Jun 24 2003