id:A031346 - OEIS Search Results

Search: id:A031346

Displaying 1-1 of 1 results found.

page 1

Multiplicative persistence: number of iterations of "multiply digits" needed to reach a number < 10.

+0
20

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 1, 1, 1, 2, 2, 2, 2, 3, 2, 3, 1, 1, 2, 2, 2, 3, 2, 3, 2, 3, 1, 1, 2, 2, 2, 2, 3, 2, 3, 3, 1, 1, 2, 2, 3, 3, 2, 4, 3, 3, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 1, 1, 2, 3, 3, 3, 3, 3, 3, 2 (list; graph; listen)

	OFFSET	`0,26`
	LINKS	`T. D. Noe, Table of n, a(n) for n=0..10000` `N. J. A. Sloane, The persistence of a number, J. Recreational Math., 6 (1973), 97-98.` `Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.`
	CROSSREFS	`Cf. A031347.` `Sequence in context: A016016 A063059 A102675 this_sequence A087472 A054348 A037813` `Adjacent sequences: A031343 A031344 A031345 this_sequence A031347 A031348 A031349`
	KEYWORD	`nonn,base`
	AUTHOR	`Eric Weisstein (eric(AT)weisstein.com)`

page 1

Search completed in 0.002 seconds

Last modified July 4 13:19 EDT 2008. Contains 140839 sequences.

AT&T Labs Research