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 A276330 #10 Aug 31 2016 20:55:30
%S A276330 0,1,1,1,4,1,1,1,4,1,1,1,4,1,1,1,4,1,18,1,4,1,1,1,4,1,1,1,4,1,1,1,4,1,
%T A276330 1,1,18,1,1,1,4,1,1,1,4,1,1,1,4,1,1,1,4,1,18,1,4,1,1,1,4,1,1,1,4,1,1,
%U A276330 1,4,1,1,1,18,1,1,1,4,1,1,1,4,1,1,1,4,1,1,1,4,1,18,1,4,1,1,1,96
%N A276330 a(n) = largest term of A001563 that divides n, a(0) = 0.
%H A276330 Antti Karttunen, <a href="/A276330/b276330.txt">Table of n, a(n) for n = 0..4319</a>
%F A276330 a(0) = 0; for n >= 1, a(n) = A001563(A276329(n)).
%F A276330 Other identities. For all n >= 0:
%F A276330 A276331(n) = n - a(n).
%t A276330 f[n_] := Block[{a = {{0, n}}}, Do[AppendTo[a, {First@ #, Last@ #} &@ QuotientRemainder[a[[-1, -1]], (# #!) &[# - i]]], {i, 0, # - 1}] &@ NestWhile[# + 1 &, 0, (# #!) &[# + 1] <= n &]; Rest[a][[All, 1]]]; {0}~Join~Table[# #! &[Length@ TakeWhile[Reverse@ f@ n, # == 0 &] + 1], {n, 120}] (* _Michael De Vlieger_, Aug 31 2016 *)
%o A276330 (Scheme) (define (A276330 n) (if (zero? n) n (A001563 (A276329 n))))
%Y A276330 Cf. A001563, A258199, A276328, A276329, A276331.
%K A276330 nonn
%O A276330 0,5
%A A276330 _Antti Karttunen_, Aug 30 2016