login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A062330 a(n) = product of the sum and product of the digits of a(n-1) (0 is not to be considered a factor in the product). 1
2, 4, 16, 42, 48, 384, 1440, 144, 144, 144, 144, 144, 144, 144, 144, 144, 144, 144, 144, 144, 144, 144, 144, 144, 144, 144, 144, 144, 144, 144, 144, 144, 144, 144, 144, 144, 144, 144, 144, 144, 144, 144, 144, 144, 144, 144, 144, 144, 144, 144, 144, 144, 144 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

LINKS

Harry J. Smith, Table of n, a(n) for n=1,...,100

EXAMPLE

a(4) = 42 hence a(5) = 8*6 = 48.

PROG

(PARI) SumD(x)= { s=0; while (x>9, s+=x-10*(x\10); x\=10); return(s + x) } ProdNzD(x)= { p=1; while (x>9, d=x-10*(x\10); if (d, p*=d); x\=10); return(p*x) } { for (n=1, 100, if (n>1, a=SumD(a)*ProdNzD(a), a=2); write("b062330.txt", n, " ", a) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Aug 05 2009]

CROSSREFS

Sequence in context: A051861 A048222 A192890 * A133465 A110128 A148279

Adjacent sequences:  A062327 A062328 A062329 * A062331 A062332 A062333

KEYWORD

nonn,base,easy

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jun 21 2001

EXTENSIONS

Corrected and extended by Larry Reeves (larryr(AT)acm.org) and Harvey P. Dale (hpd1(AT)nyu.edu), Jun 22 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 06:46 EST 2012. Contains 205867 sequences.