|
Search: id:A046523
|
|
|
| A046523 |
|
Smallest number with same prime signature as n. |
|
+0
20
|
|
| 1, 2, 2, 4, 2, 6, 2, 8, 4, 6, 2, 12, 2, 6, 6, 16, 2, 12, 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, 12, 6, 12, 2, 24, 6, 24, 6, 6, 2, 60, 2, 6, 12, 64, 6, 30, 2, 12, 6, 30, 2, 72, 2, 6, 12, 12, 6, 30, 2, 48, 16, 6, 2, 60, 6, 6, 6, 24, 2
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..10000
|
|
FORMULA
|
In prime factorization of n, replace most common prime by 2, next most common by 3, etc.
|
|
EXAMPLE
|
If p,q,.. are different primes, a(p)=2, a(p^2)=4, a(pq)=6, a(p^2*q)=12, etc.
n = 108 = 2.2.3.3.3 is replaced by a(n) = 2.2.2.3.3 = 72; n = 105875 = 5.5.5.7.11.11 is represented by a(n) = 2.2.2.3.3.5 = 360. Prime-powers are replaced by corresponding powers of 2, primes by 2. Factorials,primorials and LCM[1,..,n] are in the sequence. A000005(a(n)) = A000005(n) remains invariant; least and largest prime factors of a(n) are 2 or p[A001221(n)] resp.
|
|
MATHEMATICA
|
Table[Apply[Times, p[w]^Reverse[Sort[ex[w]]]], {w, 1, 1000}] p[x_] := Table[Prime[w], {w, 1, lf[x]}] ex[x_] := Table[Part[ffi[x], 2*w], {w, 1, lf[x]}] ffi[x_] := Flatten[FactorInteger[x]] lf[x_] := Length[FactorInteger[x]]
|
|
CROSSREFS
|
A025487 gives range of values of this sequence.
Cf. A000142, A002110, A003418, A001221, A000040, A000005.
Sequence in context: A129457 A119655 A083260 this_sequence A071364 A067824 A107067
Adjacent sequences: A046520 A046521 A046522 this_sequence A046524 A046525 A046526
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
Corrected and extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Mar 11 2004
|
|
|
Search completed in 0.002 seconds
|
