cp's OEIS Frontend

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.

A359600 The least odd number with the same prime signature as n.

This page as a plain text file.
%I A359600 #15 Jan 12 2023 16:26:30
%S A359600 1,3,3,9,3,15,3,27,9,15,3,45,3,15,15,81,3,45,3,45,15,15,3,135,9,15,27,
%T A359600 45,3,105,3,243,15,15,15,225,3,15,15,135,3,105,3,45,45,15,3,405,9,45,
%U A359600 15,45,3,135,15,135,15,15,3,315,3,15,45,729,15,105,3,45,15,105,3,675,3,15,45,45,15,105,3,405,81
%N A359600 The least odd number with the same prime signature as n.
%F A359600 a(n) = A003961(A046523(n)).
%p A359600 a:= n-> (l-> mul(ithprime(i+1)^l[i][2], i=1..nops(l)))
%p A359600         (sort(ifactors(n)[2], (x, y)->x[2]>y[2])):
%p A359600 seq(a(n), n=1..100);  # _Alois P. Heinz_, Jan 12 2023
%o A359600 (PARI) a(n) = { my(f=vecsort(factor(n)[, 2], , 4)); prod(i=1, #f, prime(i+1)^f[i]) } \\ _Andrew Howroyd_, Jan 12 2023
%o A359600 (Python)
%o A359600 from math import prod
%o A359600 from sympy import prime, factorint
%o A359600 def A359600(n): return prod(prime(i)**e for i, e in enumerate(sorted(factorint(n).values(), reverse=True),2)) # _Chai Wah Wu_, Jan 12 2023
%Y A359600 Cf. A003961, A046523, A101296.
%Y A359600 Cf. also A278223.
%K A359600 nonn
%O A359600 1,2
%A A359600 _Antti Karttunen_, Jan 12 2023