id:A074808 - OEIS Search Results

Search: id:A074808

Displaying 1-1 of 1 results found.

page 1

Let f(n) be 2n + POD(n) + 1 if n is even, otherwise 2n - POD(n) - 1, where POD(n) is the product of digits of n. Sequence gives smallest number requiring n iterations to reach a prime.

+0
1

2, 1, 13, 8, 9, 34, 86, 51, 113, 348, 193, 152, 80, 199, 736, 579, 448, 502, 446, 281, 339, 532, 1521, 760, 438, 371, 971, 524, 1642, 988, 1613, 6856, 4494, 5146, 2793, 1348, 3916, 5531, 6544, 3570, 7982, 6415, 3211, 1633, 11634, 9462 (list; graph; listen)

	OFFSET	`1,1`
	EXAMPLE	`a(3) = 13 because 13 -(1)-> 22 -(2)-> 49 -(3)-> 61.`
	CROSSREFS	`Sequence in context: A064079 A167584 A112226 this_sequence A113097 A032001 A118679` `Adjacent sequences: A074805 A074806 A074807 this_sequence A074809 A074810 A074811`
	KEYWORD	`base,nonn`
	AUTHOR	`Jason Earls (zevi_35711(AT)yahoo.com), Sep 08 2002`

page 1

Search completed in 0.002 seconds

Last modified November 24 23:16 EST 2009. Contains 167481 sequences.

AT&T Labs Research