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

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

0,2

LINKS

Eric Weisstein's World of Mathematics, Multiplicative Persistence

CROSSREFS

Sequence in context: A019859 A188736 A102769 * A109696 A110948 A199871

Adjacent sequences:  A031345 A031346 A031347 * A031349 A031350 A031351

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 14 21:44 EST 2012. Contains 205663 sequences.