id:A087472 - OEIS Search Results

Search: id:A087472

Displaying 1-1 of 1 results found.

page 1

Number of iterations required for the function f(n) to reach a single digit, where f(n) is the product of the two numbers formed from the alternating digits of n.

+0
5

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, 1, 1, 1, 1, 1, 1 (list; graph; listen)

	OFFSET	`1,25`
	COMMENT	`A087471(n) gives the final digit reached by successive iterations of Murthy's function, f(n). A087473(n) gives the smallest number that requires n iterations of Murthy's function to reach a single digit. The n-th row of triangle A087474 gives the n successive iterations of Murthy's function on A087473(n).`
	EXAMPLE	`a(1234)= 3 since f(1234)=1324=312, f(312)=321=32, and` `f(32)=3*2=6.`
	CROSSREFS	`Cf. A087471, A087473, A087474.` `Sequence in context: A063059 A102675 A031346 this_sequence A054348 A037813 A083534` `Adjacent sequences: A087469 A087470 A087471 this_sequence A087473 A087474 A087475`
	KEYWORD	`nonn,base`
	AUTHOR	`Amarnath Murthy (amarnath_murthy(AT)yahoo.com) and Paul D. Hanna (pauldhanna(AT)juno.com), Sep 11 2003`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research