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 A076563 #26 Aug 07 2022 17:48:00
%S A076563 0,0,2,0,3,0,6,6,5,0,9,0,7,10,14,0,15,0,15,14,11,0,21,20,13,24,21,0,
%T A076563 25,0,30,22,17,28,33,0,19,26,35,0,35,0,33,40,23,0,45,42,45,34,39,0,51,
%U A076563 44,49,38,29,0,55,0,31,56,62,52,55,0,51,46,63,0,69,0,37,70,57,66,65,0,75
%N A076563 a(n) = n - greatest prime divisor of n, for n>1.
%H A076563 Michael De Vlieger, <a href="/A076563/b076563.txt">Table of n, a(n) for n = 2..10000</a>
%F A076563 a(p) = 0 for prime p.
%F A076563 a(n) = n - A006530(n). - _Michel Marcus_, Jan 16 2015
%t A076563 Table[n-Last@(First/@FactorInteger[n]),{n,2,200}] (* _Vladimir Joseph Stephan Orlovsky_, Apr 08 2011 *)
%o A076563 (PARI) a(n) = n - vecmax(factor(n)[,1]); \\ _Michel Marcus_, Aug 07 2022
%o A076563 (Python)
%o A076563 from sympy import factorint
%o A076563 def a(n): return n - max(factorint(n))
%o A076563 print([a(n) for n in range(2, 81)]) # _Michael S. Branicky_, Aug 07 2022
%Y A076563 Cf. A006530, A070229.
%K A076563 easy,nonn
%O A076563 2,3
%A A076563 _Zak Seidov_, Oct 19 2002