A344713 a(n) is the number of iterations needed for n to reach 0 under the mapping x -> A055212(x).

1, 1, 1, 2, 1, 2, 1, 2, 2, 2, 1, 2, 1, 2, 2, 2, 1, 2, 1, 2, 2, 2, 1, 2, 2, 2, 2, 2, 1, 3, 1, 3, 2, 2, 2, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 2, 1, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 1, 3, 1, 2, 2, 2, 2, 3, 1, 2, 2, 3, 1, 3, 1, 2, 2, 2, 2, 3, 1, 2, 2, 2, 1, 3, 2, 2, 2, 2, 1, 3, 2, 2, 2, 2, 2, 3, 1, 2, 2, 3, 1, 3, 1, 2, 3, 2, 1, 3, 1, 3

Offset

1,4

Comments

Since x > A055212(x) for all positive integers x, and the smallest value of A055212(x) is 0, every trajectory under iteration of the mapping x -> A055212(x) will end at 0.

If n = 1 or n is prime, then 0 will be reached in just one iteration of the mapping. Moreover, a(1), a(2), and a(3) form the only run of three consecutive 1's. All other 1's are isolated according to the prime numbers greater than 3.

If n is a composite number, then its trajectory under the mapping consists of a first step n -> A055212(n) followed by a(A055212(n)) steps to reach 0. So, a(n) = a(A055212(n)) + 1.

Links

Table of n, a(n) for n=1..110.

Example

a(1) = 1, since 1 -> 0.
a(p) = 1, since p -> 0 for any prime p.
a(4) = 2, since 4 -> 1 -> 0.
a(30) = 3, since 30 -> 4 -> 1 -> 0.
a(1440) = 4, since 1440 -> 32 -> 4 -> 1 -> 0.

Mathematica

f[0] = 0; f[n_] := DivisorSigma[0, n] - PrimeNu[n] - 1; a[n_] := -2 + Length @ FixedPointList[f, n]; Array[a, 100] (* Amiram Eldar, Jun 03 2021 *)

Crossrefs

Cf. A000005, A036459, A055212.

Sequence in context: A183025 A072410 A342824 * A072491 A051034 A024935

Adjacent sequences: A344710 A344711 A344712 * A344714 A344715 A344716

Keyword

nonn

Author

Timothy L. Tiffin, May 26 2021

Status

approved