OFFSET
1,1
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..1000
Shyam Sunder Gupta, Smith Numbers.
Wayne L. McDaniel, The Existence of infinitely Many k-Smith numbers, Fibonacci Quarterly, Vol. 25, No. 1 (1987), pp. 76-80.
EXAMPLE
19899699 is a 4^(-1) Smith number because the digit sum of 19899699, i.e., S(19899699) = 1 + 9 + 8 + 9 + 9 + 6 + 9 + 9 = 60, which is equal to 4 times the sum of the digits of its prime factors, i.e., 4*Sp(19899699) = 4*Sp (3*2203*3011) = 4*(3 + 2 + 2 + 0 + 3 + 3 + 0 + 1 + 1) = 15.
MATHEMATICA
digSum[n_] := Plus @@ IntegerDigits[n]; qSmithQ[n_] := CompositeQ[n] && 4 * Plus @@ (Last@# * digSum[First@#] & /@ FactorInteger[n]) == digSum[n]; Select[Range[10^8], qSmithQ] (* Amiram Eldar, Aug 23 2020 *)
CROSSREFS
KEYWORD
base,nonn
AUTHOR
Shyam Sunder Gupta, Mar 16 2005
STATUS
approved