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 A356152 #8 Jul 28 2022 15:15:33
%S A356152 1,2,3,1,1,3,1,1,3,2,1,3,1,2,3,1,1,6,1,5,3,2,1,3,5,2,3,1,1,6,1,1,3,2,
%T A356152 5,9,1,2,3,5,1,3,1,1,9,2,1,3,7,5,3,1,1,6,5,7,3,2,1,15,1,2,3,1,5,6,1,1,
%U A356152 3,10,1,9,1,2,15,1,7,3,1,5,3,2,1,3,5,2,3,1,1,18,7,1,3,2,5,3,1,14,9,25,1,6,1,1,15
%N A356152 Numerator of n / the smallest positive k such that n divides k*A276086(k), where A276086 is primorial base exp-function.
%H A356152 Antti Karttunen, <a href="/A356152/b356152.txt">Table of n, a(n) for n = 1..65537</a>
%H A356152 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%F A356152 a(n) = n / A356151(n) = n / gcd(n, A355944(n)).
%o A356152 (PARI)
%o A356152 A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
%o A356152 A356152(n) = for(k=1, oo, if((k*A276086(k))%n==0, return(n/gcd(n,k))));
%Y A356152 Cf. A276086, A324580, A355944, A355945, A356151, A356153 (denominators).
%K A356152 nonn,frac
%O A356152 1,2
%A A356152 _Antti Karttunen_, Jul 28 2022