id:A074871 - OEIS Search Results

Search: id:A074871

Displaying 1-1 of 1 results found.

page 1

Number of steps needed to reach a prime when the map S(n)+M(n) is applied to n; 0 if a prime is never reached. Here S(n) and M(N) mean the sum and the product of the digits of n in base 10.

+0
1

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

	OFFSET	`1,17`
	EXAMPLE	`a(28)=3 because 28 ->26 ->20 ->2`
	CROSSREFS	`Adjacent sequences: A074868 A074869 A074870 this_sequence A074872 A074873 A074874` `Sequence in context: A016397 A037908 A116663 this_sequence A050372 A037802 A037879`
	KEYWORD	`easy,nonn,base`
	AUTHOR	`Felice Russo (felice.russo(AT)katamail.com), Sep 12 2002`

page 1

Search completed in 0.002 seconds

Last modified May 16 01:24 EDT 2008. Contains 139630 sequences.

AT&T Labs Research