cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A270570 Largest number in the sequence for the Collatz problem (excluding the original number) when started at n.

Original entry on oeis.org

1, 16, 2, 16, 16, 52, 4, 52, 16, 52, 16, 40, 52, 160, 8, 52, 52, 88, 16, 64, 52, 160, 16, 88, 40, 9232, 52, 88, 160, 9232, 16, 100, 52, 160, 52, 112, 88, 304, 20, 9232, 64, 196, 52, 136, 160, 9232, 24, 148, 88, 232, 40, 160, 9232, 9232, 52, 196, 88, 304, 160
Offset: 2

Views

Author

Douglas Boffey, Mar 19 2016

Keywords

Examples

			For n = 7, the sequence is: 7, 22, 11, 34, 17, *52*, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1. The highest value in the list (starred) is 52.
		

Programs

  • Mathematica
    Table[k = n; maxk = 0; While[k ≠ 1, If[EvenQ[k], k = k/2, k = 3*k + 1]; maxk = Max[maxk, k]]; maxk, {n, 2, 100}] (* Robert Price, Apr 11 2016 *)