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 A331732 #5 Jan 25 2020 20:53:47 %S A331732 1,1,1,3,1,9,1,5,3,27,1,25,1,81,9,7,1,15,1,125,27,243,1,49,3,729,5, %T A331732 625,1,75,1,11,81,2187,9,35,1,6561,243,343,1,375,1,3125,25,19683,1, %U A331732 121,3,45,729,15625,1,21,27,2401,2187,59049,1,245,1,177147,125,13,81,1875,1,78125,6561,225,1,77,1,531441,15,390625,9,9375,1,1331 %N A331732 Odd part of A241909(n). %H A331732 Antti Karttunen, <a href="/A331732/b331732.txt">Table of n, a(n) for n = 1..16384</a> %H A331732 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a> %F A331732 a(n) = A000265(A241909(n)). %o A331732 (PARI) %o A331732 A000265(n) = (n/2^valuation(n, 2)); %o A331732 A241909(n) = if(1==n||isprime(n),2^primepi(n),my(f=factor(n),h=1,i,m=1,p=1,k=1); while(k<=#f~, p = nextprime(1+p); i = primepi(f[k,1]); m *= p^(i-h); h = i; if(f[k,2]>1, f[k,2]--, k++)); (p*m)); %o A331732 A331732(n) = A000265(A241909(n)); %Y A331732 Cf. A000265, A241909, A331601. %Y A331732 Cf. also A322865, A331731. %K A331732 nonn %O A331732 1,4 %A A331732 _Antti Karttunen_, Jan 25 2020