Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A063574
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A063574 Number of steps to reach an integer == 1 (mod 4) when iterating the map n -> 3n/2 if n even or (3n+1)/2 if n odd. +0
4
0, 2, 1, 2, 0, 1, 2, 4, 0, 4, 1, 3, 0, 1, 3, 4, 0, 2, 1, 2, 0, 1, 2, 3, 0, 3, 1, 7, 0, 1, 4, 6, 0, 2, 1, 2, 0, 1, 2, 5, 0, 6, 1, 3, 0, 1, 3, 5, 0, 2, 1, 2, 0, 1, 2, 3, 0, 3, 1, 4, 0, 1, 5, 6, 0, 2, 1, 2, 0, 1, 2, 4, 0, 4, 1, 3, 0, 1, 3, 4, 0, 2, 1, 2, 0, 1, 2, 3, 0, 3, 1, 5, 0, 1, 4, 5, 0, 2, 1, 2, 0, 1, 2, 7, 0 (list; graph; listen)
page 1

Search completed in 0.001 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 1 19:22 EST 2009. Contains 167811 sequences.


AT&T Labs Research