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.

Showing 1-1 of 1 results.

A224533 Odd numbers n for which the number of iterations to reach the largest equals number of iterations to reach 1 from the largest in Collatz (3x+1) trajectory of n.

Original entry on oeis.org

1, 335, 1249, 2013, 6557, 6801, 6803, 7501, 7505, 10219, 22633, 25183, 27075, 31839, 36633, 36691, 40985, 45013, 45027, 45041, 59365, 61601, 64577, 64579, 75179, 75507, 77267, 86015, 88465, 88473, 97059, 97061, 97069, 97073, 97075, 97261, 107903, 108545
Offset: 1

Views

Author

T. D. Noe, Apr 14 2013

Keywords

Crossrefs

Cf. A224303.

Programs

  • Mathematica
    Collatz[n_] := NestWhileList[If[EvenQ[#], #/2, 3*# + 1] &, n, # > 1 &]; Select[Range[1, 100000, 2], Position[Collatz[#], Max[Collatz[#]]] == {{(Length[Collatz[#]] + 1)/2}} &]
Showing 1-1 of 1 results.