Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A078419
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A078419 Numbers n such that h(n) = 2 h(n-1) where h(n) is the length of the sequence {n, f(n), f(f(n)), ...., 1} in the Collatz (or 3x + 1) problem. (The earliest "1" is meant.) +0
3
2, 5, 22, 495, 559, 2972, 3092, 3124, 3147, 3153, 3184, 3367, 3711, 3748, 3857, 3921, 3982, 4450, 4767, 17019, 17708, 17769, 17771, 17782, 17796, 17825, 17835, 17857, 17863, 17892, 18079, 18082, 18139, 18298, 18422, 18580, 18644, 18688, 18784 (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 11 12:57 EST 2009. Contains 170656 sequences.


AT&T Labs Research