A031352 6-multiplicative persistence: number of iterations of "multiply 6th powers of digits" needed to reach 0 or 1.

0, 3, 3, 2, 3, 3, 3, 3, 3, 1, 1, 3, 3, 2, 3, 3, 3, 3, 3, 1, 3, 2, 3, 3, 2, 3, 3, 3, 2, 1, 3, 3, 3, 3, 2, 2, 3, 2, 2, 1, 2, 3, 3, 3, 2, 2, 2, 2, 3, 1, 3, 2, 2, 2, 2, 2, 3, 2, 2, 1, 3, 3, 2, 2, 2, 3, 2, 2, 3, 1, 3, 3, 3, 2, 3, 2, 2, 2, 2, 1, 3, 3, 2, 2, 2, 2, 2, 3, 2, 1, 3, 2, 2, 3, 2, 3, 2, 2, 3

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: A178307 A327465 A079063 * A245885 A188834 A276575

Adjacent sequences: A031349 A031350 A031351 * A031353 A031354 A031355

Keyword

nonn,base

Author

Eric W. Weisstein

Extensions

Offset 1 from Seiichi Manyama, Jan 13 2020

Status

approved