|
| |
|
|
A070165
|
|
Triangle read by rows giving trajectory of n in Collatz problem.
|
|
10
| |
|
|
1, 2, 1, 3, 10, 5, 16, 8, 4, 2, 1, 4, 2, 1, 5, 16, 8, 4, 2, 1, 6, 3, 10, 5, 16, 8, 4, 2, 1, 7, 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1, 8, 4, 2, 1, 9, 28, 14, 7, 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1, 10, 5, 16, 8, 4, 2, 1, 11, 34, 17, 52, 26, 13
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| n-th row has A006577(n) entries.
|
|
|
LINKS
| T. D. Noe, Rows n=1..100 of triangle, flattened
Eric Weisstein's World of Mathematics, Collatz Problem
Wikipedia, Collatz conjecture
Index entries for sequences related to 3x+1 (or Collatz) problem
|
|
|
EXAMPLE
| 1; 2,1; 3,10,5,16,8,4,2,1; 4,2,1; 5,16,8,4,2,1; ...
|
|
|
PROG
| (Haskell)
a070165 n k = a070165_tabf !! (n-1) !! (k-1)
a070165_tabf = map a070165_row [1..]
a070165_row n = (takeWhile (/= 1) $ iterate a006370 n) ++ [1]
a070165_list = concat a070165_tabf
-- Reinhard Zumkeller, Oct 07 2011
|
|
|
CROSSREFS
| Cf. A006667.
Cf. A006370; A033493 (row sums).
Sequence in context: A058113 A126009 A091858 * A203709 A196371 A119928
Adjacent sequences: A070162 A070163 A070164 * A070166 A070167 A070168
|
|
|
KEYWORD
| nonn,easy,tabf
|
|
|
AUTHOR
| Eric Weisstein (eric(AT)weisstein.com), Apr 23, 2002
|
| |
|
|
