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 A063917 #20 Feb 11 2020 14:57:53
%S A063917 1,2,3,4,5,6,7,8,6,5,11,12,13,7,15,8,17,6,19,8,21,11,23,12,20,13,9,7,
%T A063917 29,15,31,14,33,17,10,12,37,19,39,8,41,21,43,11,15,23,47,18,28,20,51,
%U A063917 13,53,9,11,10,57,29,59,15,61,31,21,16,13,33,67,17,69
%N A063917 Smallest k such that k!!! is a multiple of n.
%D A063917 F. Smarandache, "Some problems in number theory", Student Conference, University of Craiova, Department of Mathematics, 1979.
%H A063917 Vincenzo Librandi, <a href="/A063917/b063917.txt">Table of n, a(n) for n = 1..2000</a>
%H A063917 Anonymous, <a href="http://www.gallup.unm.edu/~smarandache/SKF.htm">Smarandache k-factorial</a>
%e A063917 a(16) = 8 because 8!!! = 8*(8 - 3)*(8 - 6) = 8*5*2 which is divisible by 16 and 8 is the smallest integer with this property.
%t A063917 f[n_] := Product[k, {k, n, 1, -3}]; a[n_] := Module[{k = 1}, While[! Divisible[ f[k], n], k++]; k]; Array[a, 100] (* _Amiram Eldar_, Dec 08 2018 *)
%t A063917 With[{tbl=Table[Times@@Range[k,1,-3],{k,100}]},Table[Position[tbl,_?(Divisible[ #,n]&),1,1],{n,70}]]//Flatten (* _Harvey P. Dale_, Feb 11 2020 *)
%Y A063917 Cf. A007661.
%K A063917 nonn
%O A063917 1,2
%A A063917 Mike Antholy (mikeantholy(AT)yahoo.ca), Aug 31 2001
%E A063917 Offset changed and more terms by _Amiram Eldar_, Dec 08 2018