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

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

0,2

LINKS

Eric Weisstein's World of Mathematics, Multiplicative Persistence

CROSSREFS

Sequence in context: A161778 A099655 A146899 * A068923 A103714 A193514

Adjacent sequences:  A031348 A031349 A031350 * A031352 A031353 A031354

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 23:53 EST 2012. Contains 205689 sequences.