The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A063737 Numbers n such that sum of digits of n is equal to the sum of the prime factors of n, counted with multiplicity. 7

%I

%S 2,3,4,5,7,27,378,576,588,648,729,2688,17496,19683,49896,69888,

%T 3796875,3857868,4898880,5878656,7077888,8957952,2499898464,

%U 34998578496,49997969280,2928898896840,7625597484987,184958866998359685

%N Numbers n such that sum of digits of n is equal to the sum of the prime factors of n, counted with multiplicity.

%C a(29) > 10^30. - _Giovanni Resta_, Apr 23 2017

%e 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.

%o (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;.

%Y Cf. A001414, A007953.

%K base,easy,nonn

%O 1,1

%A _Felice Russo_, Aug 13 2001

%E More terms from _Klaus Brockhaus_, Aug 17 2001

%E More terms from _David Wasserman_, Jul 11 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 11 15:58 EDT 2020. Contains 335626 sequences. (Running on oeis4.)