The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A031349 3-multiplicative persistence: number of iterations of "multiply 3rd powers of digits" needed to reach 0 or 1. 4
 0, 4, 5, 4, 3, 4, 4, 3, 3, 1, 1, 4, 5, 4, 3, 4, 4, 3, 3, 1, 4, 4, 4, 3, 2, 3, 4, 2, 3, 1, 5, 4, 3, 3, 4, 3, 4, 3, 4, 1, 4, 3, 3, 2, 2, 3, 3, 3, 3, 1, 3, 2, 4, 2, 3, 2, 3, 2, 3, 1, 4, 3, 3, 3, 2, 3, 2, 2, 3, 1, 4, 4, 4, 3, 3, 2, 4, 3, 2, 1, 3, 2, 3, 3, 2, 2, 3, 3, 3, 1, 3, 3, 4, 3, 3, 3, 2, 3, 3 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Seiichi Manyama, Table of n, a(n) for n = 1..10000 Eric Weisstein's World of Mathematics, Multiplicative Persistence CROSSREFS Sequence in context: A071413 A161811 A016717 * A200605 A036444 A329505 Adjacent sequences:  A031346 A031347 A031348 * A031350 A031351 A031352 KEYWORD nonn,base,changed AUTHOR STATUS approved

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

Last modified January 19 21:47 EST 2020. Contains 331066 sequences. (Running on oeis4.)