id:A080758 - OEIS Search Results

Search: id:A080758

Displaying 1-1 of 1 results found.

page 1

Number of steps needed to reach a prime starting with n and iterating x-->floor(3x/2).

+0
1

1, 4, 3, 1, 2, 6, 12, 1, 5, 7, 11, 1, 2, 4, 6, 2, 10, 6, 3, 1, 3, 18, 5, 1, 93, 9, 5, 1, 2, 3, 35, 2, 17, 8, 4, 27, 3, 92, 8, 1, 4, 8, 6, 1, 2, 3, 34, 1, 13, 16, 7, 1, 3, 26, 4, 2, 91, 20, 7, 53, 2, 3, 7, 1, 5, 4, 3, 1, 2, 25, 33, 1, 4, 12, 15, 33, 6, 4, 5, 2, 25, 13, 3, 1, 2, 90, 19, 2, 6, 52, 7, 1 (list; graph; listen)

	OFFSET	`2,2`
	EXAMPLE	`3-->4-->6-->9-->13. Hence 4 steps are needed and a(3)=4.`
	CROSSREFS	`Sequence in context: A157464 A046546 A139623 this_sequence A123683 A010306 A006467` `Adjacent sequences: A080755 A080756 A080757 this_sequence A080759 A080760 A080761`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Mar 08 2003`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research