A285494

2017-06-03, post № 171

mathematics, OEIS, programming, Python, Wolfram Language, #decimal, #decimal sum, #digit sum, #distinct prime, #int, #integer, #number, #number theory, #prime, #prime factors, #primes

The On-Line Encyclopedia of Integer Sequences gets regularly updated with new integer sequences. One of the recent updates was contributed by me, A285494.

A285494 is the list of all numbers 𝑘 so that its digit sum equals its number of distinct prime factors.
A number’s digit sum is the sum of all of its decimal digits. The number 𝟨𝟤𝟪𝟥𝟣𝟪𝟧𝟥, for example, has a digit sum of 𝟨 + 𝟤 + 𝟪 + 𝟥 + 𝟣 + 𝟪 + 𝟧 + 𝟥 = 𝟥𝟨.
A number’s number of distinct prime factors is the number of different prime numbers that multiply together to result in the original number. As an example, $62831853=3^2\cdot 7\cdot 127\cdot 7853$ , so it has five prime factors of which four are distinct.
Thereby one can conclude that 𝟨𝟤𝟪𝟥𝟣𝟪𝟧𝟥 is not an entry in this sequence, as $36\neq 4$ .

The sequence is certainly infinite, as the number $k=2\cdot 10^n$ with $n\in \mathbb{N}^*$ has a digit sum of $2+(0\cdot n)=2$ and — because $k=2^{n+1}\cdot 5^n$ — exactly two distinct prime factors.

In the encyclopedia entry, I provided a Mathematica one-liner to compute the first few entries of this sequence. Since then, I have also written a Python two-liner to achieve the same goal.

(* Mathematica *)
Select[Range[2,10000],Total[IntegerDigits[#]]==Length[FactorInteger[#]]&]
Out = {20, 30, 102, 120, 200, 300, 1002, 1200, 2000, 2001, 2002, 3000, 3010}

# Python 2.7
>>> def p(n):exec"i,f=2,set()\nwhile n>1:\n\tif n%i==0:f.add(i);n/=i;i=1\n\ti+=1";return len(f)
>>> print filter(lambda n:p(n)==sum(map(int,str(n))),range(2,10001))
[20, 30, 102, 120, 200, 300, 1002, 1200, 2000, 2001, 2002, 3000, 3010]

Extra assets: a285494_development.py