login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

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

%I #12 Jan 13 2020 09:33:25

%S 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,

%T 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,

%U 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

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

%H Seiichi Manyama, <a href="/A031354/b031354.txt">Table of n, a(n) for n = 1..10000</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/MultiplicativePersistence.html">Multiplicative Persistence</a>

%K nonn,base

%O 1,2

%A _Eric W. Weisstein_

%E Offset 1 from _Seiichi Manyama_, Jan 13 2020