a(n) = min_{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.
A036845
a(n) = min_{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) =2a(3) =2a(4) =4a(5) =2a(6) =4a(7) =4a(8) =4a(9) =4a(10) =4a(11) =4a(12) =12a(13) =4a(14) =8a(15) =8a(16) =16a(17) =4a(18) =16a(19) =8a(20) =12a(21) =4a(22) =12a(23) =8a(24) =12a(25) =12a(26) =16a(27) =12a(28) =16a(29) =8
External references
- oeis: A036845