A031356 - OEIS

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

A031356

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

1

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

(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: A223934 A237531 A238504 * A304522 A308641 A024676

Adjacent sequences: A031353 A031354 A031355 * A031357 A031358 A031359

KEYWORD

nonn,base

AUTHOR

Eric W. Weisstein

EXTENSIONS

Offset 1 from Seiichi Manyama, Jan 13 2020

STATUS

approved