|
| |
|
|
A063114
|
|
n + product of nonzero digits of n.
|
|
17
| |
|
|
2, 4, 6, 8, 10, 12, 14, 16, 18, 11, 12, 14, 16, 18, 20, 22, 24, 26, 28, 22, 23, 26, 29, 32, 35, 38, 41, 44, 47, 33, 34, 38, 42, 46, 50, 54, 58, 62, 66, 44, 45, 50, 55, 60, 65, 70, 75, 80, 85, 55, 56, 62, 68, 74, 80, 86, 92, 98, 104, 66, 67, 74, 81, 88, 95, 102, 109, 116
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
LINKS
| Harry J. Smith, Table of n, a(n) for n=1,...,1000
P. A. Loomis, An Interesting Family of Iterated Sequences
|
|
|
FORMULA
| a(n) = n + A051801(n). [Reinhard Zumkeller, Jan 15 2012]
|
|
|
EXAMPLE
| a(59) = 59 + 5*9 = 104. a(66) = 66 + 6*6 = 102.
|
|
|
MATHEMATICA
| Table[i+Times@@(IntegerDigits[i]/. 0->1), {i, 70}]
|
|
|
PROG
| (ARIBAS): var stk: stack; end; for n := 1 to 80 do s := itoa(n); for j := 0 to length(s) -1 do k := atoi(s[j..j]); if k > 0 then stack_push(stk, k); end; end; write(n + product(stack2array(stk)), " "); end;
(PARI) ProdNzD(x)= { local(d, p); p=1; while (x>9, d=x-10*(x\10); if (d, p*=d); x\=10); return(p*x) } { for (n=1, 1000, write("b063114.txt", n, " ", n + ProdNzD(n)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Aug 19 2009]
(Haskell)
a063114 n = n + a051801 n -- Reinhard Zumkeller, Jan 15 2012
|
|
|
CROSSREFS
| Cf. A063108, A063112, A063113, A063543.
Sequence in context: A169805 A098727 A095815 * A064806 A062028 A070196
Adjacent sequences: A063111 A063112 A063113 * A063115 A063116 A063117
|
|
|
KEYWORD
| nonn,easy,base
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com), Aug 08 2001
|
|
|
EXTENSIONS
| More terms from Robert G. Wilson v (rgwv(AT)rgwv.com) and Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Aug 09 2001
|
| |
|
|
