|
| |
|
|
A063738
|
|
Numbers n such that sum of digits of n is equal to the product of the digits of the sum of the prime factors of n, counted with multiplicity.
|
|
0
| |
|
|
2, 3, 4, 5, 7, 27, 46, 52, 93, 117, 121, 143, 170, 174, 187, 228, 235, 240, 242, 250, 259, 341, 408, 451, 504, 512, 671, 682, 684, 720, 754, 759, 781, 810, 867, 888, 1017, 1120, 1143, 1155, 1173, 1247, 1272, 1276, 1357, 1362, 1377, 1449, 1456, 1524, 1537, 1564
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
LINKS
| Matthew M. Conroy, Home page (listed instead of email address)
|
|
|
EXAMPLE
| 27: 2+7=9, 27= 3 * 3 * 3, 3+3+3=9; 170: 170=2*5*17, 1+7+0=8, 2+5+17=24, 2*4=8.
|
|
|
CROSSREFS
| Sequence in context: A065774 A048459 A203615 * A063737 A135709 A028980
Adjacent sequences: A063735 A063736 A063737 * A063739 A063740 A063741
|
|
|
KEYWORD
| easy,base,nonn
|
|
|
AUTHOR
| Felice Russo (frusso(AT)micron.com), Aug 13 2001
|
|
|
EXTENSIONS
| Better description and more terms from Matthew M. Conroy, Aug 14 2001
|
| |
|
|
