|
Search: id:A092893
|
|
|
| A092893 |
|
Smallest starting value in a Collatz '3x+1' sequence such that the sequence contains exactly n tripling steps. |
|
+0
2
|
|
| 1, 5, 3, 17, 11, 7, 9, 25, 33, 43, 57, 39, 105, 135, 185, 123, 169, 219, 159, 379, 283, 377, 251, 167, 111, 297, 395, 263, 175, 233, 155, 103, 137, 91, 121, 161, 107, 71, 47, 31, 41, 27, 73, 97, 129, 171, 231, 313, 411, 543, 731, 487, 327, 859, 1145, 763, 1017, 1351
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
First occurrence of n in A006667.
These are the odd (primitive) terms in A129304. - T. D. Noe, Apr 09 2007
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=0..300
Eric Weisstein's World of Mathematics, Collatz Problem. Link to a section of MathWorld.
Index entries for sequences related to 3x+1 (or Collatz) problem
|
|
EXAMPLE
|
a(4)=11 because the Collatz sequence 11,34,17,52,26,13,40,20,10,5,16,8,4,2,1 is the first sequence containing 4 tripling steps.
|
|
CROSSREFS
|
Cf. A006667, A092892, A087228.
Sequence in context: A073677 A053371 A105201 this_sequence A133172 A075453 A073845
Adjacent sequences: A092890 A092891 A092892 this_sequence A092894 A092895 A092896
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Hugo Pfoertner (hugo(AT)pfoertner.org), Mar 11 2004
|
|
|
Search completed in 0.002 seconds
|
