[go: up one dir, main page]
login
The OEIS is supported by the many generous donors to the OEIS Foundation.
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: A161811 A016717 A366153 * A200605 A036444 A329505
Adjacent sequences: A031346 A031347 A031348 * A031350 A031351 A031352
KEYWORD
nonn,base
AUTHOR
Eric W. Weisstein
STATUS
approved

Lookup Welcome Wiki Register Music Plot 2 Demos Index WebCam Contribute Format Style Sheet Transforms Superseeker Recents
The OEIS Community
Maintained by The OEIS Foundation Inc.
Last modified November 6 13:33 EST 2024. Contains 377509 sequences.
License Agreements, Terms of Use, Privacy Policy