Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A080758
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A080758 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)
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 16 17:18 EST 2009. Contains 170825 sequences.


AT&T Labs Research