The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A138846 Triangle read by rows: T(n,k) = A092892(n-k) if k <= n, 0 otherwise. 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; text; 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 * A235670 A130321 A101508 Adjacent sequences:  A138843 A138844 A138845 * A138847 A138848 A138849 KEYWORD easy,nonn,tabl AUTHOR Paul Barry, Mar 31 2008, Apr 02 2008 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 19 00:40 EST 2020. Contains 331030 sequences. (Running on oeis4.)