|
| |
|
|
A066308
|
|
Sum of digits times product of digits of n.
|
|
1
| |
|
|
1, 4, 9, 16, 25, 36, 49, 64, 81, 0, 2, 6, 12, 20, 30, 42, 56, 72, 90, 0, 6, 16, 30, 48, 70, 96, 126, 160, 198, 0, 12, 30, 54, 84, 120, 162, 210, 264, 324, 0, 20, 48, 84, 128, 180, 240, 308, 384, 468, 0, 30, 70, 120, 180, 250, 330, 420, 520, 630, 0, 42, 96, 162, 240, 330
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
LINKS
| Harry J. Smith, Table of n, a(n) for n=1,...,1000
|
|
|
EXAMPLE
| n=12, a[n]=(1+2).1.2=6<n n=19 a[n]=(1+9).1.9=90>n n=135 a[n]=(1+3+5).1.3.5=135=n
|
|
|
MATHEMATICA
| asum[x_] := Apply[Plus, IntegerDigits[x]] apro[x_] := Apply[Times, IntegerDigits[x]] a[n]=asum[n]*apro[n]
sdpd[n_]:=Module[{idn=IntegerDigits[n]}, Total[idn]Times@@idn]; Array[ sdpd, 70] (* From Harvey P. Dale, Dec 31 2011 *)
|
|
|
PROG
| (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) } { for (n=1, 1000, a=SumD(n)*ProdD(n); write("b066308.txt", n, " ", a) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Feb 09 2010]
|
|
|
CROSSREFS
| Cf. A038369, A049101-A049106, A034710, A061672, A066306, A066307.
Sequence in context: A111707 A115300 A085942 * A063462 A098736 A002015
Adjacent sequences: A066305 A066306 A066307 * A066309 A066310 A066311
|
|
|
KEYWORD
| base,nonn
|
|
|
AUTHOR
| Labos E. (labos(AT)ana.sote.hu), Dec 13 2001
|
| |
|
|
