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 A276329 #9 Aug 31 2016 20:55:48
%S A276329 1,1,1,2,1,1,1,2,1,1,1,2,1,1,1,2,1,3,1,2,1,1,1,2,1,1,1,2,1,1,1,2,1,1,
%T A276329 1,3,1,1,1,2,1,1,1,2,1,1,1,2,1,1,1,2,1,3,1,2,1,1,1,2,1,1,1,2,1,1,1,2,
%U A276329 1,1,1,3,1,1,1,2,1,1,1,2,1,1,1,2,1,1,1,2,1,3,1,2,1,1,1,4,1,1,1,2,1,1,1,2,1,1,1,3,1,1,1,2,1,1,1,2,1,1,1,2
%N A276329 a(n) = largest k such that A001563(k) divides n.
%H A276329 Antti Karttunen, <a href="/A276329/b276329.txt">Table of n, a(n) for n = 1..4320</a>
%t A276329 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]]]; Table[Length@ TakeWhile[Reverse@ f@ n, # == 0 &] + 1, {n, 120}] (* _Michael De Vlieger_, Aug 31 2016 *)
%o A276329 (Scheme) (define (A276329 n) (let loop ((i (A258198 n))) (cond ((zero? i) 1) ((zero? (modulo n (A001563 i))) i) (else (loop (- i 1))))))
%Y A276329 Cf. A001563, A258198, A276330.
%K A276329 nonn
%O A276329 1,4
%A A276329 _Antti Karttunen_, Aug 30 2016