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.

A375911 Largest value in the trajectory of 2*n - 1 in the Farkas map (A349407).

Original entry on oeis.org

1, 3, 5, 17, 9, 17, 17, 15, 17, 29, 21, 53, 25, 27, 29, 161, 33, 53, 37, 39, 41, 65, 45, 161, 49, 51, 53, 125, 57, 89, 161, 63, 65, 101, 69, 161, 73, 75, 77, 269, 81, 125, 85, 87, 89, 137, 161, 485, 97, 99, 101, 233, 105, 161, 125, 111, 113, 173, 117, 269, 161
Offset: 1

Views

Author

Paolo Xausa, Sep 02 2024

Keywords

Examples

			a(10) = 29 because 29 is the largest value in the trajectory 19 -> 29 -> 15 -> 5 -> 3 -> 1.
		

Crossrefs

Programs

  • Mathematica
    FarkasStep[x_] := Which[Divisible[x, 3], x/3, Mod[x, 4] == 3, (3*x + 1)/2, True, (x + 1)/2];
    Array[Max[FixedPointList[FarkasStep, 2*# - 1]] &, 100]

Formula

a(n) = max{A350279(n,k) for 1 <= k <= A375909(n) + 1}.