|
Search: id:A028394
|
|
| |
|
| 8, 11, 15, 10, 13, 17, 23, 31, 41, 55, 73, 97, 129, 86, 115, 153, 102, 68, 91, 121, 161, 215, 287, 383, 511, 681, 454, 605, 807, 538, 717, 478, 637, 849, 566, 755, 1007, 1343, 1791, 1194, 796, 1061, 1415
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
It is an unsolved problem to determine if this sequence is bounded or unbounded.
|
|
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. [From N. J. A. Sloane, Jul 14 2009]
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=0..1000
J. C. Lagarias, The 3x+1 problem and its generalizations, Amer. Math. Monthly, 92 (1985), 3-23.
|
|
FORMULA
|
The map is: n -> if n mod 3 = 0 then 2*n/3 elif n mod 3 = 1 then (4*n-1)/3 else (4*n+1)/3.
|
|
MAPLE
|
G := proc(n) option remember; if n = 0 then 8 elif 4*G(n-1) mod 3 = 0 then 2*G(n-1)/3 else round(4*G(n-1)/3); fi; end; [ seq(G(i), i=0..80) ];
|
|
CROSSREFS
|
Cf. A006369.
Sequence in context: A096679 A101573 A029629 this_sequence A078117 A032423 A063724
Adjacent sequences: A028391 A028392 A028393 this_sequence A028395 A028396 A028397
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
J. H. Conway (conway(AT)math.princeton.edu)
|
|
|
Search completed in 0.002 seconds
|
