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.

A386244 Number of iterations of seven segments count x -> A277116(x) to go from n to a fixed point.

Original entry on oeis.org

1, 2, 1, 1, 0, 0, 0, 2, 3, 1, 4, 1, 3, 3, 1, 3, 4, 1, 2, 3, 2, 3, 5, 5, 2, 5, 2, 4, 4, 5, 2, 3, 5, 5, 2, 5, 2, 4, 4, 5, 5, 1, 2, 2, 4, 2, 5, 3, 2, 2, 2, 3, 5, 5, 2, 5, 2, 4, 4, 5, 4, 4, 2, 2, 5, 2, 4, 2, 4, 2, 2, 1, 4, 4, 3, 4, 2, 1, 5, 4, 4, 2, 4, 4, 2, 4, 4, 5, 2, 4
Offset: 0

Views

Author

Marco Ripà, Aug 21 2025

Keywords

Comments

A277116 a strictly decreasing function A277116(x) < x whenever x >= 10 and all single digit x reach a fixed point A277116(x) = x with x in {4, 5, 6}.
This sequence is unbounded and the first occurrence of a(n) = k is at n = A338255(k + 1) for any k >= 3.

Examples

			For n = 10, the a(10) = 3 steps are 10 -> 8 -> 7 -> 3 -> 5 segments, and 5 is a fixed point A074458(5) = 5.

Links

Crossrefs

Cf. A277116, A328330, A385249, A386910, A387106.
Cf. A006942, A010371, A063720, A074458 (segments variation).
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.