The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A063114

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A063114

n + product of nonzero digits of n.
(history; published version)

#28 by Michel Marcus at Sun Aug 18 05:13:01 EDT 2024

STATUS

reviewed

approved

#27 by Joerg Arndt at Sun Aug 18 03:49:16 EDT 2024

STATUS

proposed

reviewed

#26 by Jason Yuen at Sun Aug 18 03:41:01 EDT 2024

STATUS

editing

proposed

#25 by Jason Yuen at Sun Aug 18 03:40:52 EDT 2024

PROG

(PARI)

(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)) ) \\ _Harry J. Smith_, Aug 19 2009

for (n=1, 1000, write("b063114.txt", n, " ", n + ProdNzD(n)) ) \\ Harry J. Smith, Aug 19 2009

STATUS

approved

editing

#24 by Reinhard Zumkeller at Mon Jan 27 10:25:20 EST 2014

STATUS

editing

approved

#23 by Reinhard Zumkeller at Mon Jan 27 10:09:20 EST 2014

KEYWORD

nonn,easy,base,look

STATUS

approved

editing

#22 by Charles R Greathouse IV at Sun Dec 15 01:40:15 EST 2013

STATUS

editing

approved

#21 by Charles R Greathouse IV at Sun Dec 15 01:40:12 EST 2013

LINKS

Harry J. Smith, <a href="/A063114/b063114.txt">Table of n, a(n) for n = 1,...,1000</a>

FORMULA

a(n) = n + A051801(n). [_- _Reinhard Zumkeller_, Jan 15 2012]

PROG

(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_, Aug 19 2009]

STATUS

approved

editing

#20 by N. J. A. Sloane at Fri Nov 29 20:48:31 EST 2013

STATUS

editing

approved

#19 by N. J. A. Sloane at Fri Nov 29 20:48:28 EST 2013

LINKS

P. A. Loomis, <a href="/A063108/a063108.pdf">An Introduction to Digit Product Sequences</a>, J. Rec. Math., 32 (2003-2004), 147-151. [Archived Annotated archived copy]

STATUS

approved

editing