# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a062997
Showing 1-1 of 1

%I A062997 #13 Jun 28 2018 04:47:52
%S A062997 10,11,12,13,14,15,16,17,18,19,20,21,30,31,40,41,50,51,60,61,70,71,80,
%T A062997 81,90,91,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,
%U A062997 115,116,117,118,119,120,121,122,130,131,140,141,150,151,160,161,170
%N A062997 Sum of digits is strictly greater than product of digits.
%C A062997 Every multiple of 10 is a term.
%H A062997 Harry J. Smith, <a href="/A062997/b062997.txt">Table of n, a(n) for n = 1..1000</a>
%e A062997 118 is a term as 1 + 1 + 8 = 10, 10 > 8 and 8 = 1 * 1 * 8.
%t A062997 Select[Range[170], (Plus @@ IntegerDigits[ # ]) > (Times @@ IntegerDigits[ # ]) &] (_Alonso del Arte_, May 16 2005)
%o A062997 (PARI) SumD(x)= { s=0; while (x>9, s+=x-10*(x\10); x\=10); return(s + x) } ProdD(x)= { p=1; while (x>9, p*=(x-10*(x\10)); x\=10); return(p*x) } { n=0; for (a=1, 10^9, if (SumD(a) > ProdD(a), write("b062997.txt", n++, " ", a); if (n==1000, break)) ) } \\ _Harry J. Smith_, Aug 15 2009
%Y A062997 Cf. A007953, A007954, A034710, A062329, A062996, A062998, A062999.
%K A062997 base,nonn,easy
%O A062997 1,1
%A A062997 _Amarnath Murthy_, Jun 27 2001
%E A062997 Extended by Larry Reeves (larryr(AT)acm.org) and _Henry Bottomley_, Jun 29 2001

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE