A071366 -id:A071366 - cp's OEIS frontend

A071364 Smallest number with same sequence of exponents in canonical prime factorization as n.

1, 2, 2, 4, 2, 6, 2, 8, 4, 6, 2, 12, 2, 6, 6, 16, 2, 18, 2, 12, 6, 6, 2, 24, 4, 6, 8, 12, 2, 30, 2, 32, 6, 6, 6, 36, 2, 6, 6, 24, 2, 30, 2, 12, 12, 6, 2, 48, 4, 18, 6, 12, 2, 54, 6, 24, 6, 6, 2, 60, 2, 6, 12, 64, 6, 30, 2, 12, 6, 30, 2, 72, 2, 6, 18, 12, 6, 30, 2, 48, 16, 6, 2, 60, 6, 6, 6, 24

Offset: 1

Reinhard Zumkeller, May 21 2002

nonn

A046523(a(n))=A046523(n); A046523(n)<=a(n)<=n; A001221(a(n))=A001221(n), A001222(a(n))=A001222(n); A020639(a(n))=2, A006530(a(n))=A000040(A001221(n))<=A006530(n); A000005(a(n))=A000005(n);
a(a(n))=a(n); a(n)=2^k iff n=p^k, p prime, k>0 (A000961); if n>1 is not a prime power, then a(n) mod 6 = 0; range of values = A055932, as distinct prime factors of a(n) are consecutive: a(n)=n iff n=A055932(k) for some k;
a(A003586(n))=A003586(n).

			a(105875) = a(5*5*5*7*11*11) = 2*2*2*3*5*5 = 600.

Daniel Forgues, Table of n, a(n) for n=1..100000

Cf. A071365, A071366.
Cf. A000040.
Cf. A085079, A089247.
The range is A055932.
The reversed version is A331580.
Unsorted prime signature is A124010.
Numbers whose prime signature is aperiodic are A329139.
Cf. A056239, A112798, A233249, A333217, A333219, A334032, A334033.

a071364 = product . zipWith (^) a000040_list . a124010_row
-- Reinhard Zumkeller, Feb 19 2012

Table[ e = Last /@ FactorInteger[n]; Product[Prime[i]^e[[i]], {i, Length[e]}], {n, 88}] (* Ray Chandler, Sep 23 2005 *)

a(n) = f = factor(n); for (i=1, #f~, f[i,1] = prime(i)); factorback(f); \\ Michel Marcus, Jun 13 2014

from math import prod
from sympy import prime, factorint
def A071364(n): return prod(prime(i+1)**p[1] for i,p in enumerate(sorted(factorint(n).items()))) # Chai Wah Wu, Sep 16 2022

In prime factorization of n, replace least prime by 2, next least by 3, etc.

a(n) = product(A000040(k)^A124010(k): k=1..A001221(n)). - Reinhard Zumkeller, Apr 27 2013

Extended by Ray Chandler, Sep 23 2005

A071365 Numbers k such that A071364(k) <> A046523(k).

Original entry on oeis.org

18, 50, 54, 75, 90, 98, 108, 126, 147, 150, 162, 198, 234, 242, 245, 250, 270, 294, 300, 306, 324, 338, 342, 350, 363, 375, 378, 414, 450, 486, 490, 500, 507, 522, 525, 540, 550, 558, 578, 588, 594, 600, 605, 630, 648, 650, 666, 686, 702, 722, 726, 735, 738

Offset: 1

Reinhard Zumkeller, May 21 2002

nonn

A071364(k) and A046523(k) have the same prime factors, but not the same sequence of exponents in their prime factorizations.
A046523(k) <> k, as A046523(k) <= A071366(k) <= k.
Numbers with more than one prime factor and, in the ordered factorization, at least one exponent is greater than the previous exponent when read from left to right; contains A097319. - Ray Chandler, Sep 23 2005
Choie et al. call the complementary set of integers (n = p1^e1 * p2^e^2 * ... with exponents e1 >= e2 >= e3 >= ... in their ordered prime factorization) Hardy-Ramanujan integers. - R. J. Mathar, Dec 08 2011
The numbers of terms that do not exceed 10^k, for k = 1, 2, ..., are 0, 6, 71, 759, 7758, 77948, 780216, 7803437, 78033303, 780315757, ... . Apparently, the asymptotic density of this sequence exists and equals 0.07803... . - Amiram Eldar, Aug 04 2024

			For k = 50 = 2*5*5: A071364(50) = 2*3*3 = 18, A046523(50) = 2*2*3 = 12.
For k = 500 = 2*2*5*5*5: A071364(500) = 2*2*3*3*3 = 108, A046523(500) = 2*2*2*3*3 = 72.

Alois P. Heinz, Table of n, a(n) for n = 1..10000
Y. Choie, N. Lichiardopol, P. Moree, and P. Sole, On Robin's criterion for the Riemann hypothesis, J. Theor. Nombr. Bord. 19 (2) (2007), 357-372

Cf. A046523, A071364, A071366.

a:= proc(n) option remember; local i, k, l;
      for k from 1 +`if`(n=1, 0, a(n-1))
      do l:= sort(ifactors(k)[2], (x, y)->x[1]Alois P. Heinz, Aug 18 2014

Select[Range[750], (e = Last /@ FactorInteger[ # ]) != Sort[e, Greater] &] (* Ray Chandler, Sep 23 2005 *)
Select[Range[750],
OrderedQ[FactorInteger[#][[All, 2]], GreaterEqual] == False &] (* Kenneth A Klinger, Nov 22 2016 *)

is(k) = {my(e = factor(k)[,2]); e != vecsort(e, , 4);} \\ Amiram Eldar, Aug 04 2024

Extended by Ray Chandler, Sep 23 2005

cp's OEIS Frontend

A071364 Smallest number with same sequence of exponents in canonical prime factorization as n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Mathematica

PARI

Python

Formula

Extensions