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 A328573 #9 Oct 20 2019 21:47:12 %S A328573 1,1,3,1,3,1,5,5,15,1,15,1,5,5,15,1,15,1,5,5,15,1,15,1,5,5,15,1,15,1, %T A328573 7,7,21,7,21,7,35,35,105,1,105,1,35,35,105,1,105,1,35,35,105,1,105,1, %U A328573 35,35,105,1,105,1,7,7,21,7,21,7,35,35,105,1,105,1,35,35,105,1,105,1,35,35,105,1,105,1,35,35,105,1,105,1,7,7,21,7,21 %N A328573 a(n) = A328475(n) / A328572(n). %H A328573 Antti Karttunen, <a href="/A328573/b328573.txt">Table of n, a(n) for n = 0..32768</a> %H A328573 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a> %F A328573 a(n) = A328475(n) / A328572(n). %o A328573 (PARI) %o A328573 A328475(n) = { my(m=1, p=2, y=1); while(n, if(n%p, m *= p^((n%p)-y), y=0); n = n\p; p = nextprime(1+p)); (m); }; %o A328573 A328572(n) = { my(m=1, p=2); while(n, if(n%p, m *= p^((n%p)-1)); n = n\p; p = nextprime(1+p)); (m); }; %o A328573 A328573(n) = (A328475(n) / A328572(n)); %Y A328573 Cf. A002110, A276086, A328475, A328572, A328580. %Y A328573 Cf. A328574 (positions of 1's). %K A328573 nonn %O A328573 0,3 %A A328573 _Antti Karttunen_, Oct 20 2019