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 A343504 #8 Apr 18 2021 10:21:48
%S A343504 1,1,1,1,2,2,1,1,1,1,2,2,2,2,2,2,2,2,3,3,3,3,6,6,1,1,1,1,2,2,1,1,1,1,
%T A343504 2,2,2,2,2,2,2,2,3,3,3,3,6,6,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,6,6,
%U A343504 6,6,6,6,3,3,3,3,6,6,3,3,3,3,6,6,6,6,6
%N A343504 a(n) is the least common multiple of the nonzero digits in factorial base expansion of n.
%C A343504 a(0) = 1 by convention.
%H A343504 Rémy Sigrist, <a href="/A343504/b343504.txt">Table of n, a(n) for n = 0..10000</a>
%H A343504 <a href="/index/Fa#facbase">Index entries for sequences related to factorial base representation</a>
%F A343504 a(n) = 1 iff n belongs to A059590.
%e A343504 For n = 1000000:
%e A343504 - the factorial base expansion of 1000000 is "2, 6, 6, 2, 5, 1, 2, 2, 0",
%e A343504 - so a(1000000) = lcm(1, 2, 5, 6) = 30.
%o A343504 (PARI) a(n) = { my (v=1); for (r=2, oo, if (n==0, return (v), n%r, v=lcm(v, n%r)); n\=r) }
%Y A343504 Cf. A052429, A059590, A108731, A328582.
%K A343504 nonn,look,base
%O A343504 0,5
%A A343504 _Rémy Sigrist_, Apr 17 2021