|
Search: id:A062997
|
|
|
| A062997 |
|
Sum of digits is strictly greater than product of digits. |
|
+0
5
|
|
| 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 30, 31, 40, 41, 50, 51, 60, 61, 70, 71, 80, 81, 90, 91, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 130, 131, 140, 141, 150, 151, 160, 161, 170
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Every multiple of 10 is a term.
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=1,...,1000
|
|
EXAMPLE
|
118 is a term as 1 + 1 + 8 = 10, 10 > 8 and 8 = 1 * 1 * 8.
|
|
MATHEMATICA
|
Select[Range[170], (Plus @@ IntegerDigits[ # ]) > (Times @@ IntegerDigits[ # ]) &] (Alonso Delarte (alonso.delarte(AT)gmail.com), May 16 2005)
|
|
PROGRAM
|
(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)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Aug 15 2009]
|
|
CROSSREFS
|
Cf. A007953, A007954, A034710, A062329, A062996, A062998, A062999.
Sequence in context: A117884 A133506 A038368 this_sequence A110429 A055982 A008717
Adjacent sequences: A062994 A062995 A062996 this_sequence A062998 A062999 A063000
|
|
KEYWORD
|
base,nonn,easy
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jun 27 2001
|
|
EXTENSIONS
|
Extended by Larry Reeves (larryr(AT)acm.org) and Henry Bottomley (se16(AT)btinternet.com), Jun 29 2001
|
|
|
Search completed in 0.002 seconds
|
