A055033 -id:A055033 - cp's OEIS frontend

A386261 a(n) = A001511(A001511(n)), where A001511 is the ruler function.

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

Offset: 1

Amiram Eldar, Jul 17 2025

The first occurrence of k = 1, 2, ... is at n = 2^(2^(k-1) - 1) = A058891(k).

The asymptotic density of the occurrences of k = 1, 2, ... in this sequence is 2^(2^(k-1))/(2^(2^k)-1) = 2/3, 4/15, 16/255, 256/65535, 65536/4294967295, ...

Amiram Eldar, Table of n, a(n) for n = 1..10000

Cf. A001511, A003159, A048649, A058891.

Similar sequences: A010553, A010554, A051027, A055033, A058699, A068346, A132090, A178601, A181776, A284908, A386262.

f[n_] := IntegerExponent[n, 2] + 1; a[n_] := f[f[n]]; Array[a, 100]

a(n) = valuation(valuation(n, 2) + 1, 2) + 1;

a(n) >= 1, with equality if and only if n is in A003159.

Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = Sum_{m>=0} 1/(2^(2^m) - 1) = 1.4039368... (A048649).

A386262 a(n) = A051903(A051903(n)) for n >= 2, a(1) = 0.

Original entry on oeis.org

0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 2, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 2, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 2, 2, 0, 0, 1, 0, 0, 0

Offset: 1

Amiram Eldar, Jul 17 2025

The first occurrence of k = 1, 2, ... is at n = 2^(2^k) = A001146(k).
If n is an exponentially squarefree number (A209061) then a(n) <= 1. The converse is not necessarily true, with n = 2592 = 2^5 * 3^4 being the least counterexample.
The asymptotic density of the occurrences of 0 in this sequence is 1/zeta(2) = 6/Pi^2 (A059956).
The asymptotic density of the occurrences of 1 in this sequence is Sum_{k squarefree > 1} (1/zeta(k+1) - 1/zeta(k)) = 0.348423339572619656701... .

Amiram Eldar, Table of n, a(n) for n = 1..10000

Cf. A005117, A001146, A051903, A059956, A209061.

Similar sequences: A010553, A010554, A051027, A055033, A058699, A068346, A132090, A178601, A181776, A284908, A386261.

f[n_] := Max[FactorInteger[n][[;; , 2]]]; f[1] = 0; a[n_] := f[f[n]]; a[1] = 0; Array[a, 100]

f(n) = if(n == 1, 0, vecmax(factor(n)[,2]));
a(n) = if(n == 1, 0, f(f(n)));

a(n) = 0 if and only if n is squarefree (A005117).

Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = Sum_{k>=2} A051903(k) * (1/zeta(k+1)-1/zeta(k)) = 0.43779421197744649258... .

A289126 Numbers n such that usigma(usigma(n))/usigma(n) > usigma(usigma(m))/usigma(m) for all m < n, where usigma(n) is the sum of unitary divisors of n (A034448).

Original entry on oeis.org

1, 2, 5, 18, 164, 1538, 20018, 408404, 7759748, 148728578, 6976017044, 7317446132

Offset: 1

Amiram Eldar, Jun 25 2017

The unitary version of A289124.

Paul Erdős and M. V. Subbarao, On the iterates of some arithmetic functions, The theory of arithmetic functions (Proc. Conf., Western Michigan Univ., Kalamazoo, Mich. 1971), Lecture Notes in Math., 251 , pp. 119-125, Springer, Berlin, 1972. [alternate link]

Cf. A034448, A055033, A289124.

usigma[n_] := If[n == 1, 1, Times @@ (1 + Power @@@ FactorInteger[n])]; a = {}; k=1; rmax = 0; While[Length[a]<8, s = usigma[ k]; s2 = usigma[ s]; r = s2/s;  If[r > rmax, AppendTo[a, k]; rmax = r]; k++]; a

a(10)-a(12) from Giovanni Resta, Aug 23 2017

cp's OEIS Frontend

A386261 a(n) = A001511(A001511(n)), where A001511 is the ruler function.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A386262 a(n) = A051903(A051903(n)) for n >= 2, a(1) = 0.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A289126 Numbers n such that usigma(usigma(n))/usigma(n) > usigma(usigma(m))/usigma(m) for all m < n, where usigma(n) is the sum of unitary divisors of n (A034448).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Extensions