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 A324537 #7 Mar 07 2019 23:28:26 %S A324537 1,1,1,1,1,2,1,1,1,3,1,4,1,5,3,1,1,6,1,3,5,7,1,12,1,11,1,5,1,54,1,1,7, %T A324537 13,5,36,1,17,11,9,1,250,1,7,9,19,1,60,1,15,13,11,1,30,7,5,17,23,1, %U A324537 1620,1,29,5,1,11,686,1,13,19,375,1,540,1,31,15,17,7,2662,1,45,1,37,1,3500,13,41,23,7,1,2430,11,19,29,43,17,420,1,35,7,75,1 %N A324537 a(n) = A003557(k), where k = Product_{d|n, d>2} prime(A297167(d)). %H A324537 Antti Karttunen, <a href="/A324537/b324537.txt">Table of n, a(n) for n = 1..8192</a> %F A324537 A001222(a(n)) = A324191(n) - 1. %o A324537 (PARI) %o A324537 A061395(n) = if(1==n, 0, primepi(vecmax(factor(n)[, 1]))); %o A324537 A297167(n) = if(1==n, 0, (A061395(n) + (bigomega(n)-omega(n)) - 1)); %o A324537 A003557(n) = { my(f=factor(n)); for (i=1, #f~, f[i, 2] = f[i, 2]-1); factorback(f); }; \\ From A003557 %o A324537 A324537(n) = { my(m=1); fordiv(n, d, if(d>2, m *= prime(A297167(d)))); A003557(m); }; %Y A324537 Cf. A000961 (positions of ones), A003557, A297167, A300827, A324191, A324193, A324202, A324538. %K A324537 nonn %O A324537 1,6 %A A324537 _Antti Karttunen_, Mar 07 2019