login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A063114
a(n) = n + product of the nonzero digits of n.
22
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
OFFSET
1,1
LINKS
P. A. Loomis, An Introduction to Digit Product Sequences, J. Rec. Math., 32 (2003-2004), 147-151.
P. A. Loomis, An Introduction to Digit Product Sequences, J. Rec. Math., 32 (2003-2004), 147-151. [Annotated archived copy]
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) a(n) = n + vecprod(select(x->(x!=0), digits(n))) \\ Harry J. Smith, Aug 19 2009
(Haskell)
a063114 n = n + a051801 n -- Reinhard Zumkeller, Jan 15 2012
CROSSREFS
KEYWORD
nonn,easy,base,look,changed
AUTHOR
N. J. A. Sloane, Aug 08 2001
EXTENSIONS
More terms from Robert G. Wilson v and Klaus Brockhaus, Aug 09 2001
STATUS
approved