A325502 -id:A325502 - cp's OEIS frontend

A181819 Prime shadow of n: a(1) = 1; for n>1, if n = Product prime(i)^e(i), then a(n) = Product prime(e(i)).

1, 2, 2, 3, 2, 4, 2, 5, 3, 4, 2, 6, 2, 4, 4, 7, 2, 6, 2, 6, 4, 4, 2, 10, 3, 4, 5, 6, 2, 8, 2, 11, 4, 4, 4, 9, 2, 4, 4, 10, 2, 8, 2, 6, 6, 4, 2, 14, 3, 6, 4, 6, 2, 10, 4, 10, 4, 4, 2, 12, 2, 4, 6, 13, 4, 8, 2, 6, 4, 8, 2, 15, 2, 4, 6, 6, 4, 8, 2, 14, 7, 4, 2, 12, 4, 4, 4, 10, 2, 12, 4, 6, 4, 4, 4, 22, 2, 6, 6, 9, 2, 8, 2, 10, 8

Offset: 1

Matthew Vandermast, Dec 07 2010

a(n) depends only on prime signature of n (cf. A025487). a(m) = a(n) iff m and n have the same prime signature, i.e., iff A046523(m) = A046523(n).

Because A046523 (the smallest representative of prime signature of n) and this sequence are functions of each other as A046523(n) = A181821(a(n)) and a(n) = a(A046523(n)), it implies that for all i, j: a(i) = a(j) <=> A046523(i) = A046523(j) <=> A101296(i) = A101296(j), i.e., that equivalence-class-wise this is equal to A101296, and furthermore, applying any function f on this sequence gives us a sequence b(n) = f(a(n)) whose equivalence class partitioning is equal to or coarser than that of A101296, i.e., b is then a sequence that depends only on the prime signature of n (the multiset of exponents of its prime factors), although not necessarily in a very intuitive way. - Antti Karttunen, Apr 28 2022

			20 = 2^2*5 has the exponents (2,1) in its prime factorization. Accordingly, a(20) = prime(2)*prime(1) = A000040(2)*A000040(1) = 3*2 = 6.

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
Index entries for sequences computed from exponents in factorization of n

Column 1 of A353510 (see also A325239 and A325277).
Cf. A000040, A000265, A001511, A001222, A003963, A005361, A007814, A008578, A028234, A046523, A056239, A064553, A064989, A067029, A101296 (restricted growth sequence transform), A108951, A122111, A124010, A124859, A156552, A181820, A181821, A182850, A182855, A182857 (also A323014), A115621, A101296, A238690, A238745, A238747, A238748, A246029, A304465, A304647, A305732, A305733, A320118, A323022, A325501, A325502, A325507, A325508, A325755 (A353566), A325756, A328830 [= a(a(n))], A328835, A351564 (characteristic function of A130091), A351944, A351946, A353379.
Left inverse of A304660.

a181819 = product . map a000040 . a124010_row
-- Reinhard Zumkeller, Mar 26 2012

A181819 := proc(n)
    local a;
    a := 1;
    for pf in ifactors(n)[2] do
        a := a*ithprime(pf[2]) ;
    end do:
    a ;
end proc:
seq(A181819(n),n=1..80) ; # R. J. Mathar, Jan 09 2019
# second Maple program:
a:= n-> mul(ithprime(i[2]), i=ifactors(n)[2]):
seq(a(n), n=1..105);  # Alois P. Heinz, Nov 26 2024

{1}~Join~Table[Times @@ Prime@ Map[Last, FactorInteger@ n], {n, 2, 120}] (* Michael De Vlieger, Feb 07 2016 *)

a(n) = {my(f=factor(n)); prod(k=1, #f~, prime(f[k,2]));} \\ Michel Marcus, Nov 16 2015

;; With memoization-macro definec.
(definec (A181819 n) (cond ((= 1 n) 1) (else (* (A000040 (A067029 n)) (A181819 (A028234 n))))))
;; Antti Karttunen, Feb 05 2016

;; With memoization-macro definec.
(definec (A181819 n) (cond ((= 1 n) 1) ((even? n) (* (A000040 (A007814 n)) (A181819 (A000265 n)))) (else (A181819 (A064989 n)))))
;; Antti Karttunen, Feb 07 2016

From Antti Karttunen, Feb 07 2016: (Start)
a(1) = 1; for n > 1, a(n) = A000040(A067029(n)) * a(A028234(n)).
a(1) = 1; for n > 1, a(n) = A008578(A001511(n)) * a(A064989(n)).
Other identities. For all n >= 1:
a(A124859(n)) = A122111(a(n)) = A238745(n). - from Matthew Vandermast's formulas for the latter sequence.
(End)
a(n) = A246029(A156552(n)). - Antti Karttunen, Oct 15 2016
From Antti Karttunen, Apr 28 & Apr 30 2022: (Start)
A181821(a(n)) = A046523(n) and a(A046523(n)) = a(n). [See comments]
a(n) = A329900(A124859(n)) = A319626(A124859(n)).
a(n) = A246029(A156552(n)).
a(a(n)) = A328830(n).
a(A304660(n)) = n.
a(A108951(n)) = A122111(n).
a(A185633(n)) = A322312(n).
a(A025487(n)) = A181820(n).
a(A276076(n)) = A275735(n) and a(A276086(n)) = A328835(n).
As the sequence converts prime exponents to prime indices, it effects the following mappings:
A001221(a(n)) = A071625(n). [Number of distinct indices --> Number of distinct exponents]
A001222(a(n)) = A001221(n). [Number of indices (i.e., the number of prime factors with multiplicity) --> Number of exponents (i.e., the number of distinct prime factors)]
A056239(a(n)) = A001222(n). [Sum of indices --> Sum of exponents]
A066328(a(n)) = A136565(n). [Sum of distinct indices --> Sum of distinct exponents]
A003963(a(n)) = A005361(n). [Product of indices --> Product of exponents]
A290103(a(n)) = A072411(n). [LCM of indices --> LCM of exponents]
A156061(a(n)) = A290107(n). [Product of distinct indices --> Product of distinct exponents]
A257993(a(n)) = A134193(n). [Index of the least prime not dividing n --> The least number not among the exponents]
A055396(a(n)) = A051904(n). [Index of the least prime dividing n --> Minimal exponent]
A061395(a(n)) = A051903(n). [Index of the greatest prime dividing n --> Maximal exponent]
A008966(a(n)) = A351564(n). [All indices are distinct (i.e., n is squarefree) --> All exponents are distinct]
A007814(a(n)) = A056169(n). [Number of occurrences of index 1 (i.e., the 2-adic valuation of n) --> Number of occurrences of exponent 1]
A056169(a(n)) = A136567(n). [Number of unitary prime divisors --> Number of exponents occurring only once]
A064989(a(n)) = a(A003557(n)) = A295879(n). [Indices decremented after <--> Exponents decremented before]
Other mappings:
A007947(a(n)) = a(A328400(n)) = A329601(n).
A181821(A007947(a(n))) = A328400(n).
A064553(a(n)) = A000005(n) and A000005(a(n)) = A182860(n).
A051903(a(n)) = A351946(n).
A003557(a(n)) = A351944(n).
A258851(a(n)) = A353379(n).
A008480(a(n)) = A309004(n).
a(A325501(n)) = A325507(n) and a(A325502(n)) = A038754(n+1).
a(n!) = A325508(n).
(End)

Name "Prime shadow" (coined by Gus Wiseman in A325755) prefixed to the definition by Antti Karttunen, Apr 27 2022

A325503 Heinz number of row n of the triangle of Stirling numbers of the second kind A008277.

Original entry on oeis.org

2, 4, 20, 884, 528844, 3460086044, 340672148731996, 477782556719729075524, 11694209380474301218263758996, 4967476846044415922850025924897606724, 43298471669920632729336800855543564573041217668, 7790810575556906457316064931238939360882160372451591124244

Offset: 1

Gus Wiseman, May 07 2019

nonn

The Heinz number of a positive integer sequence (y_1,...,y_k) is prime(y_1)*...*prime(y_k).

			The sequence of terms together with their prime indices begins:
                              2: {1}
                              4: {1,1}
                             20: {1,1,3}
                            884: {1,1,6,7}
                         528844: {1,1,10,15,25}
                     3460086044: {1,1,15,31,65,90}
                340672148731996: {1,1,21,63,140,301,350}
          477782556719729075524: {1,1,28,127,266,966,1050,1701}
  11694209380474301218263758996: {1,1,36,255,462,2646,3025,6951,7770}

Index entries for sequences related to Heinz numbers

Cf. A000040, A001222, A002870, A008277, A024412, A056239, A112798, A215366, A325500, A325502.

Times@@@Table[Prime[StirlingS2[n,k]],{n,1,10},{k,1,n}]

a(n) = Product_{i = 1..n} prime(A008277(n,i)).
A061395(a(n)) = A002870(n).
A056239(a(n)) = A000110(n).

A325514 Heinz number of row n of the triangle of partition numbers A008284.

Original entry on oeis.org

2, 2, 4, 8, 24, 72, 600, 4200, 101640, 2042040, 107869080, 6435365640, 644779672680, 62219208188280, 14408598135902520, 3195700205016233640, 1246437353286578234760, 527744165981695537415640, 417665868515500206974318760, 314096677106179199154141208440

Offset: 0

Gus Wiseman, May 07 2019

nonn

The Heinz number of a positive integer sequence (y_1,...,y_k) is prime(y_1)*...*prime(y_k).

			The sequence of terms together with their prime indices begins:
             2: {1}
             2: {1}
             4: {1,1}
             8: {1,1,1}
            24: {1,1,1,2}
            72: {1,1,1,2,2}
           600: {1,1,1,2,3,3}
          4200: {1,1,1,2,3,3,4}
        101640: {1,1,1,2,3,4,5,5}
       2042040: {1,1,1,2,3,4,5,6,7}
     107869080: {1,1,1,2,3,5,5,7,8,9}
    6435365640: {1,1,1,2,3,5,5,7,10,10,11}
  644779672680: {1,1,1,2,3,5,6,7,11,12,13,15}

Index entries for sequences related to Heinz numbers

Cf. A000041, A002569, A008284, A056239, A112798, A145519, A215366, A325500, A325502, A325503, A325512, A325514.

Times@@@Table[If[n>0&&k==0,1,Prime[Length[IntegerPartitions[n,{k}]]]],{n,0,20},{k,0,n}]

A001221(a(n)) = A325512(n).
A061395(a(n)) = A002569(n).
A056239(a(n)) = A000041(n).

cp's OEIS Frontend

A181819 Prime shadow of n: a(1) = 1; for n>1, if n = Product prime(i)^e(i), then a(n) = Product prime(e(i)).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

PARI

Scheme

Scheme

Formula

Extensions

A325503 Heinz number of row n of the triangle of Stirling numbers of the second kind A008277.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A325514 Heinz number of row n of the triangle of partition numbers A008284.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula