A318170 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A318170

Composite numbers k such that A008480(k) = k.

1781030694643200, 2671546041964800, 2968384491072000, 558162298053360000, 1953568043186760000

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

Knopfmacher and Luca proved that this sequence is finite.

These numbers are named "prime-factor-perfect numbers" by Knopfmacher and Mays and "prime-perfect numbers" by Knopfmacher and Luca.

LINKS

Table of n, a(n) for n=1..5.

Arnold Knopfmacher and Florian Luca, On prime-perfect numbers, International Journal of Number Theory, Vol. 7, No. 7 (2011), pp. 1705-1716

Arnold Knopfmacher and M. E. Mays, A survey of factorization counting functions, International Journal of Number Theory, Vol. 1, No. 4 (2005), pp. 563-581, DOI: 10.1142/S1793042105000315.

EXAMPLE

1781030694643200 = 2^9 * 3^5 * 5^2 * 7^2 * 11^2 * 13 * 17 * 19 * 23 is in the sequence since multinomial(9+5+2+2+2+1+1+1+1,9,5,2,2,2,1,1,1,1) = 1781030694643200.

MATHEMATICA

mul[w_] := Total[w]!/Times @@ (w!); f[n_] := Select[ IntegerPartitions@ n, # == Reverse@ Sort[ Last /@ FactorInteger[mul[#]]] &]; Sort[mul /@ Flatten[f /@ Range[2, 30], 1]] (* terms with sum of exponents in prime factorization <= 30, Giovanni Resta, Aug 20 2018 *)

CROSSREFS

Cf. A008480.

Sequence in context: A338442 A257138 A288279 * A204419 A067495 A335044

Adjacent sequences: A318167 A318168 A318169 * A318171 A318172 A318173

KEYWORD

nonn,more,fini

AUTHOR

Amiram Eldar, Aug 20 2018

STATUS

approved