login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A031354 8-multiplicative persistence: number of iterations of "multiply 8th powers of digits" needed to reach 0 or 1. 1
0, 3, 3, 3, 2, 4, 2, 3, 2, 1, 1, 3, 3, 3, 2, 4, 2, 3, 2, 1, 3, 3, 4, 3, 2, 3, 2, 3, 2, 1, 3, 4, 2, 3, 2, 2, 3, 2, 3, 1, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 4, 3, 2, 2, 2, 2, 3, 2, 2, 1, 2, 2, 3, 2, 2, 3, 2, 2, 2, 1, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 3, 2, 2, 2, 2, 2, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
Eric Weisstein's World of Mathematics, Multiplicative Persistence
CROSSREFS
Sequence in context: A087497 A085767 A082127 * A307486 A259301 A200777
KEYWORD
nonn,base
AUTHOR
EXTENSIONS
Offset 1 from Seiichi Manyama, Jan 13 2020
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 21 19:25 EDT 2024. Contains 371885 sequences. (Running on oeis4.)