id:A131838 - OEIS Search Results

Search: id:A131838

Displaying 1-1 of 1 results found.

page 1

Multiplicative persistence of Woodall numbers.

+0
2

0, 0, 1, 2, 3, 3, 2, 1, 1, 1, 2, 2, 1, 2, 2, 1, 5, 2, 2, 1, 1, 8, 3, 1, 1, 1, 2, 2, 2, 2, 1, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 2, 2, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 (list; graph; listen)

	OFFSET	`1,4`
	COMMENT	`After the 111st terms all the numbers have some digits equal to zero thus the persistence is equal to 1.`
	EXAMPLE	`Woodall number 159 --> 159=45 --> 45=20 --> 20=0 thus persistence is 3`
	MAPLE	`P:=proc(n) local i, k, w, ok, cont; for i from 1 by 1 to n do w:=1; k:=i2^i-1; ok:=1; if k<10 then print(0); else cont:=1; while ok=1 do while k>0 do w:=w(k-(trunc(k/10)*10)); k:=trunc(k/10); od; if w<10 then ok:=0; print(cont); else cont:=cont+1; k:=w; w:=1; fi; od; fi; od; end: P(120);`
	CROSSREFS	`Cf. A003261, A131841.` `Sequence in context: A167544 A074989 A123548 this_sequence A171414 A038529 A132312` `Adjacent sequences: A131835 A131836 A131837 this_sequence A131839 A131840 A131841`
	KEYWORD	`easy,nonn,base`
	AUTHOR	`Paolo P. Lava & Giorgio Balzarotti (ppl(AT)spl.at), Jul 20 2007`

page 1

Search completed in 0.002 seconds

Last modified March 17 15:31 EDT 2010. Contains 173524 sequences.

AT&T Labs Research