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 A345932 #11 Jul 06 2021 18:28:49
%S A345932 1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,3,1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,1,1,
%T A345932 1,1,1,1,1,1,1,1,1,1,2,1,1,1,2,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,
%U A345932 1,1,1,1,1,1,2,1,1,1,1,3,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,2,1,1,1,3
%N A345932 a(n) = A002034(n) / gcd(n, A002034(n)), where A002034(n) gives the smallest positive integer k such that n divides k!.
%H A345932 Antti Karttunen, <a href="/A345932/b345932.txt">Table of n, a(n) for n = 1..65537</a>
%H A345932 <a href="/index/Fa#factorial">Index entries for sequences related to factorial numbers</a>
%F A345932 a(n) = A002034(n) / A345931(n) = A002034(n) / gcd(n, A002034(n))
%t A345932 Table[s=(m=1;While[Mod[m!,n]!=0,m++];m);s/GCD[n,s],{n,100}] (* _Giorgos Kalogeropoulos_, Jul 02 2021 *)
%o A345932 (PARI)
%o A345932 A002034(n) = if(1==n,n,my(s=factor(n)[, 1], k=s[#s], f=Mod(k!, n)); while(f, f*=k++); (k)); \\ After code in A002034.
%o A345932 A345932(n) = { my(u=A002034(n)); (u/gcd(n, u)); };
%Y A345932 Cf. A002034, A345931, A345933.
%K A345932 nonn
%O A345932 1,9
%A A345932 _Antti Karttunen_, Jul 01 2021