|
| |
|
|
A138846
|
|
Triangle read by rows: T(n,k)=if(k<=n, A092892(n-k), 0).
|
|
1
| |
|
|
1, 2, 1, 4, 2, 1, 8, 4, 2, 1, 5, 8, 4, 2, 1, 3, 5, 8, 4, 2, 1, 6, 3, 5, 8, 4, 2, 1, 12, 6, 3, 5, 8, 4, 2, 1, 24, 12, 6, 3, 5, 8, 4, 2, 1, 17, 26, 13, 20, 10, 5, 8, 4, 2, 1, 11, 17, 26, 13, 20, 10, 5, 8, 4, 2, 1
(list; table; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
COMMENTS
| A Collatz triangle.
T(n,n) is first occurrence of 1 in n steps, ordered on lowest starting value.
|
|
|
LINKS
| Eric Weisstein's World of Mathematics, Collatz Problem.
|
|
|
EXAMPLE
| Triangle begins
1,
2, 1,
4, 2, 1,
8, 4, 2, 1,
5, 8, 4, 2, 1,
3, 5, 8, 4, 2, 1,
6, 3, 5, 8, 4, 2, 1,
12, 6, 3, 5, 8, 4, 2, 1,
24, 12, 6, 3, 5, 8, 4, 2, 1,
17, 26, 13, 20, 10, 5, 8, 4, 2, 1,
11, 17, 26, 13, 20, 10, 5, 8, 4, 2, 1
|
|
|
CROSSREFS
| Sequence in context: A091918 A177953 A138895 * A130321 A101508 A106471
Adjacent sequences: A138843 A138844 A138845 * A138847 A138848 A138849
|
|
|
KEYWORD
| easy,nonn,tabl
|
|
|
AUTHOR
| Paul Barry (pbarry(AT)wit.ie), Mar 31 2008, Apr 02 2008
|
| |
|
|
