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 A365425 #10 Sep 03 2023 18:21:01
%S A365425 1,1,1,2,1,4,2,2,1,8,4,4,2,6,2,2,1,16,8,8,4,12,4,4,2,12,6,6,2,6,2,2,1,
%T A365425 32,16,16,8,24,8,8,4,36,12,12,4,12,4,4,2,24,12,12,6,30,6,6,2,12,6,6,2,
%U A365425 6,2,2,1,64,32,32,16,48,16,16,8,72,24,24,8,24,8,8,4,72,36,36,12,60,12,12,4,36,12,12,4,12,4,4,2
%N A365425 The least number with the prime signature of the odd part of A163511(n): a(n) = A046523(A000265(A163511(n))).
%H A365425 Antti Karttunen, <a href="/A365425/b365425.txt">Table of n, a(n) for n = 0..16385</a>
%F A365425 a(n) = A336158(A163511(n)) = A046523(A064989(A163511(n))).
%F A365425 For all n >= 1, a(n) = a(2*n) = a(A000265(n)).
%o A365425 (PARI)
%o A365425 A000265(n) = (n>>valuation(n,2));
%o A365425 A046523(n) = { my(f=vecsort(factor(n)[, 2], , 4), p); prod(i=1, #f, (p=nextprime(p+1))^f[i]); }; \\ From A046523
%o A365425 A163511(n) = if(!n, 1, my(p=2, t=1); while(n>1, if(!(n%2), (t*=p), p=nextprime(1+p)); n >>= 1); (t*p));
%o A365425 A365425(n) = A046523(A000265(A163511(n)));
%Y A365425 Cf. A000265, A046523, A064989, A163511, A336158.
%Y A365425 Cf. also A278531.
%K A365425 nonn
%O A365425 0,4
%A A365425 _Antti Karttunen_, Sep 03 2023