|
| |
|
|
A066309
|
|
n > (product of digits of n) * (sum of digits of n).
|
|
2
| |
|
|
10, 11, 12, 13, 20, 21, 22, 30, 31, 32, 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, 123, 124, 125, 126, 130, 131, 132, 133, 134, 140, 141, 142
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
LINKS
| Harry J. Smith, Table of n, a(n) for n=1,...,1000
|
|
|
EXAMPLE
| 13 > (1*3)*(1+3) = 12, so 13 is a term of this sequence.
n=125, a[n]=(1+2+5).1.2.5=80<125, so 125 is here.
|
|
|
MATHEMATICA
| asum[x_] := Apply[Plus, IntegerDigits[x]] apro[x_] := Apply[Times, IntegerDigits[x]] sz[x_] := asu[x]*apro[x] Do[s=sz[n]; If[Greater[n, s], Print[n]], {n, 1, 1000}]
okQ[n_]:=Module[{idn=IntegerDigits[n]}, n> Total[idn]Times@@idn]; Select[Range[150], okQ] (* From Harvey P. Dale, Mar 12 2011 *)
|
|
|
PROG
| (ARIBAS): function a066312(a, b: integer); var n, k, j, p, d: integer; s: string; begin for n := a to b do s := itoa(n); k := 0; p := 1; for j := 0 to length(s) - 1 do d := atoi(s[j..j]); k := k + d; p := p*d; end; if n > p*k then write(n, ", "); end; end; end; a066312(0, 150).
(PARI) SumD(x)= { local(s=0); while (x>9, s+=x%10; x\=10); return(s + x) } ProdD(x)= { local(p=1); while (x>9 && p>0, p*=x%10; x\=10); return(p*x) } { n=0; for (m=1, 10^9, if (m > ProdD(m)*SumD(m), write("b066309.txt", n++, " ", m); if (n==1000, return)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Feb 10 2010]
|
|
|
CROSSREFS
| Cf. A038369, A049101-A049106, A034710, A061672, A066306, A066307.
Sequence in context: A058945 A072554 A138582 * A107860 A058948 A108584
Adjacent sequences: A066306 A066307 A066308 * A066310 A066311 A066312
|
|
|
KEYWORD
| base,nonn
|
|
|
AUTHOR
| Labos E. (labos(AT)ana.sote.hu) and Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Dec 13 2001
|
| |
|
|
