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 A351577 #11 Apr 02 2022 09:57:59
%S A351577 1,1,1,1,3,3,1,1,1,1,3,3,5,5,5,5,15,15,25,25,25,25,75,75,1,1,1,1,3,3,
%T A351577 1,1,1,1,3,3,5,5,5,5,15,15,25,25,25,25,75,75,7,7,7,7,21,21,7,7,7,7,21,
%U A351577 21,35,35,35,35,105,105,175,175,175,175,525,525,49,49,49,49,147,147,49,49,49,49,147,147,245
%N A351577 a(n) = A003557(A276076(n)).
%H A351577 Antti Karttunen, <a href="/A351577/b351577.txt">Table of n, a(n) for n = 0..10080</a>
%H A351577 <a href="/index/Fa#facbase">Index entries for sequences related to factorial base representation</a>
%F A351577 a(n) = A003557(A276076(n)).
%F A351577 a(n) = A276076(A276009(n)).
%F A351577 a(n) = A328572(A351576(n)).
%F A351577 a(n) = A085731(A276076(n)) = gcd(A276076(n), A351950(n)).
%o A351577 (PARI)
%o A351577 A003557(n) = (n/factorback(factorint(n)[, 1]));
%o A351577 A276076(n) = { my(i=0,m=1,f=1,nextf); while((n>0),i=i+1; nextf = (i+1)*f; if((n%nextf),m*=(prime(i)^((n%nextf)/f));n-=(n%nextf));f=nextf); m; };
%o A351577 A351577(n) = A003557(A276076(n));
%Y A351577 Cf. A003557, A085731, A276009, A276076, A328572, A351576, A351950, A351952.
%K A351577 nonn,base,look
%O A351577 0,5
%A A351577 _Antti Karttunen_, Apr 01 2022