|
| |
|
|
A033496
|
|
Numbers n such that initial number is largest number in trajectory of 3x+1 problem.
|
|
9
| |
|
|
1, 2, 4, 8, 16, 20, 24, 32, 40, 48, 52, 56, 64, 68, 72, 80, 84, 88, 96, 100, 104, 112, 116, 128, 132, 136, 144, 148, 152, 160, 168, 176, 180, 184, 192, 196, 200, 208, 212, 224, 228, 232, 240, 244, 256, 260, 264, 272, 276, 280, 288, 296, 304, 308, 312, 320, 324
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| Or, possible peak values in 3x+1 trajectories: 1,2 and n=16k+4,16k+8,16k but not for all k; those 4k numbers [like n=16k+12 and others] which cannot be such peaks are listed in A087252.
A008908(a(n)) = A159999(a(n)). [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 04 2009]
|
|
|
LINKS
| T. D. Noe, Table of n, a(n) for n=1..2000
Index entries for sequences related to 3x+1 (or Collatz) problem
|
|
|
EXAMPLE
| These peak values occur in 1, 3, 6, 8, 9, 11, 12, 13, 14, 15, 16, 17, 18, 21, 22, 27, 30, 39, 44, 71, 75, 1579 [3x+1]-iteration trajectories started with different initial values. This list most probably is incomplete.
|
|
|
CROSSREFS
| Cf. A025586, A087251-A087256.
Sequence in context: A051513 A036993 A087257 * A109713 A082003 A093107
Adjacent sequences: A033493 A033494 A033495 * A033497 A033498 A033499
|
|
|
KEYWORD
| nonn,nice,easy
|
|
|
AUTHOR
| Jeff Burch (gburch(AT)erols.com)
|
|
|
EXTENSIONS
| Additional comments from Labos E. (labos(AT)ana.sote.hu), Sep 09 2003
|
| |
|
|
