A031350 - OEIS

A031350

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

0, 4, 3, 3, 3, 3, 2, 2, 3, 1, 1, 4, 3, 3, 3, 3, 2, 2, 3, 1, 4, 3, 3, 2, 2, 2, 3, 3, 2, 1, 3, 3, 3, 2, 2, 2, 3, 3, 3, 1, 3, 2, 2, 3, 2, 3, 3, 2, 3, 1, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 3, 2, 2, 3, 2, 3, 3, 2, 2, 1, 2, 3, 3, 3, 2, 3, 2, 3, 3, 1, 2, 3, 3, 2, 2, 2, 3, 3, 3, 1, 3, 2, 3, 3, 2, 2, 3, 3, 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

PROG

(Magma) pers:=func<n, e|&*[c^e:c in Intseq(n)]>; a:=[0]; for n in [2..100] do m:=1; k:=n; while not pers(k, 4) in {0, 1} do k:=pers(k, 4); m:=m+1; end while; Append(~a, m); end for; a; // Marius A. Burtea, Jan 13 2020

CROSSREFS

Sequence in context: A171627 A239884 A143487 * A031353 A356764 A085415

Adjacent sequences: A031347 A031348 A031349 * A031351 A031352 A031353

KEYWORD

nonn,base

AUTHOR

Eric W. Weisstein

EXTENSIONS

Offset 1 from Seiichi Manyama, Jan 13 2020

STATUS

approved