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.

A073396 The number n equals the product of two numbers: sums of prime factors of n, with and without repetition.

Original entry on oeis.org

16, 27, 150
Offset: 1

Views

Author

Reinhard Zumkeller, Jul 30 2002

Keywords

Comments

Numbers n such that n = A008472(n)*A001414(n) (= sum of distinct prime factors of n, times sum of prime factors of n with repetition). - M. F. Hasler, May 05 2013

Examples

			A073395(150) = A073395(2*3*5*5) = A008472(2*3*5*5)*A001414(2*3*5*5) = (2+3+5)*(2+3+5+5) = 10*15 = 150, therefore 150 is a term.
		

Crossrefs

Programs

  • Mathematica
    okQ[n_] := n>1 && With[{f = FactorInteger[n]}, n == Total[Times @@@ f]* Total[f[[All, 1]]]];
    Select[Range[1000], okQ] (* Jean-François Alcover, Apr 06 2021 *)

Formula

a(n) = A073395(a(n)).
A073396 = { n | n = A008472(n)*A001414(n) }. - M. F. Hasler, May 05 2013

Extensions

Proof that there are no further terms added by Max Alekseyev, May 04 2013