login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A028398 When map in A006368 is iterated, all numbers fall into cycles; order cycles by smallest entry; a(n) is smallest entry in n-th cycle (some cycles are infinite). 4
0, 1, 2, 4, 8, 14, 40, 44, 64, 80, 82, 104, 136, 172, 184, 188, 242, 256, 274, 280, 296, 352, 368, 382, 386, 424, 472, 496, 526, 530, 608, 622, 638, 640, 652, 670, 688, 692, 712, 716, 752, 760, 782, 784, 800, 814, 824, 832, 860, 878, 904, 910, 932, 964, 980, 1022 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

Iterations of A006368 starting with a(3)=4, a(4)=8, a(5)=14 and a(6)=40 give trajectories A180853, A028393, A028395, A182205 respectively. [Reinhard Zumkeller, Apr 18 2012]

REFERENCES

D. Gale, Tracking the Automatic Ant and Other Mathematical Explorations, A Collection of Mathematical Entertainments Columns from The Mathematical Intelligencer, Springer, 1998; see p. 16.

LINKS

Table of n, a(n) for n=0..55.

Index entries for sequences related to 3x+1 (or Collatz) problem

CROSSREFS

Sequence in context: A061297 A130711 A093483 * A155249 A113553 A118884

Adjacent sequences:  A028395 A028396 A028397 * A028399 A028400 A028401

KEYWORD

nonn

AUTHOR

J. H. Conway and Wouter Meeussen

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 2 12:56 EST 2016. Contains 278678 sequences.