a(n) = max_{k} {T(n,k)} where T(n,k) is the "phi/sigma tug-of-war sequence with seed n" defined by T(n,1) = phi(n), T(n,2) = sigma(phi(n)), T(n,3) = phi(sigma(phi(n))), ..., T(n,k) = phi(T(n,k-1)) if k is odd and = sigma(T(n,k-1)) if k is even.
A066437
a(n) = max_{k} {T(n,k)} where T(n,k) is the "phi/sigma tug-of-war sequence with seed n" defined by T(n,1) = phi(n), T(n,2) = sigma(phi(n)), T(n,3) = phi(sigma(phi(n))), ..., T(n,k) = phi(T(n,k-1)) if k is odd and = sigma(T(n,k-1)) if k is even.
Terms
- a(0) =1a(1) =1a(2) =3a(3) =3a(4) =12a(5) =3a(6) =12a(7) =12a(8) =12a(9) =12a(10) =18a(11) =12a(12) =28a(13) =12a(14) =15a(15) =15a(16) =72a(17) =12a(18) =72a(19) =15a(20) =28a(21) =18a(22) =36a(23) =15a(24) =42a(25) =28a(26) =72a(27) =28a(28) =72a(29) =15
External references
- oeis: A066437