|
Search: id:A063737
|
|
|
| A063737 |
|
Numbers n such that sum of digits of n is equal to the sum of the prime factors of n, counted with multiplicity. |
|
+0
1
|
|
| 2, 3, 4, 5, 7, 27, 378, 576, 588, 648, 729, 2688, 17496, 19683, 49896, 69888, 3796875, 3857868, 4898880, 5878656, 7077888, 8957952, 2499898464, 34998578496, 49997969280, 2928898896840, 7625597484987, 184958866998359685
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
EXAMPLE
|
27=3*3*3, 2+7=9, 3+3+3=9. 49896 = 2*2*2*3*3*3*3*7*11, 4+9+8+9+6 = 36, 2+2+2+3+3+3+3+7+11 = 36.
|
|
PROGRAM
|
(ARIBAS): var stk: stack; end; for n := 1 to 2000000 do s := itoa(n); for j := 0 to length(s) - 1 do stack_push(stk, atoi(s[j..j])); end; if sum(stack2array(stk)) = sum(factorlist(n)) then write(n, " "); end; end; .
|
|
CROSSREFS
|
Cf. A001414, A007953.
Sequence in context: A065774 A048459 A063738 this_sequence A135709 A028980 A096841
Adjacent sequences: A063734 A063735 A063736 this_sequence A063738 A063739 A063740
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
Felice Russo (felice.russo(AT)katamail.com), Aug 13 2001
|
|
EXTENSIONS
|
More terms from Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Aug 17 2001
More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Jul 11 2002
|
|
|
Search completed in 0.002 seconds
|
