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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A031356 10-multiplicative persistence: number of iterations of "multiply 10th powers of digits" needed to reach 0 or 1. 0
0, 2, 2, 2, 3, 2, 3, 2, 2, 1, 1, 2, 2, 2, 3, 2, 3, 2, 2, 1, 2, 2, 2, 2, 2, 3, 3, 2, 2, 1, 2, 2, 2, 3, 2, 2, 2, 2, 2, 1, 2, 2, 3, 2, 2, 2, 3, 2, 2, 1, 3, 2, 2, 2, 2, 2, 3, 2, 2, 1, 2, 3, 2, 2, 2, 2, 2, 2, 2, 1, 3, 3, 2, 3, 3, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

LINKS

Eric Weisstein's World of Mathematics, Multiplicative Persistence

CROSSREFS

Sequence in context: A048288 A050677 A058013 * A024676 A093429 A089842

Adjacent sequences:  A031353 A031354 A031355 * A031357 A031358 A031359

KEYWORD

nonn,base

AUTHOR

Eric Weisstein (eric(AT)weisstein.com)

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 13 19:19 EST 2012. Contains 205536 sequences.