|
Search: id:A104390
|
|
| |
|
| 32, 42, 60, 70, 104, 152, 231, 315, 316, 322, 330, 342, 361, 406, 430, 450, 540, 602, 610, 612, 632, 703, 722, 812, 1016, 1027, 1029, 1108, 1162, 1190, 1246, 1261, 1304, 1314, 1316, 1351, 1406, 1470, 1510, 1603, 2013, 2054, 2065, 2070, 2071, 2106, 2114
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
McDaniel, W. L., "The Existence of infinitely Many k-Smith numbers", Fibonacci Quarterly, 25(1987), pp. 76-80.
|
|
LINKS
|
S. S. Gupta, Smith Numbers.
|
|
EXAMPLE
|
32 is a 2-Smith number because sum of the digits of its prime factors, i.e. Sp (32) = Sp(2*2*2*2*2)= 2 + 2 + 2 + 2 + 2 = 10 which is equal to twice the digit sum of 32 i.e. 2*S(32) = 2*(3+2)=10
|
|
CROSSREFS
|
Cf. A006753, A104391.
Sequence in context: A167309 A159007 A114042 this_sequence A167528 A035112 A167527
Adjacent sequences: A104387 A104388 A104389 this_sequence A104391 A104392 A104393
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
Eric Weisstein (eric(AT)weisstein.com), Mar 04, 2005 and Shyam Sunder Gupta (guptass(AT)rediffmail.com), Mar 11 2005
|
|
|
Search completed in 0.002 seconds
|
