Let u(n,k) be the recursion: u(n,1)=1, u(n,2)=n, u(n,k+2) = (1/2) * (u(n,k+1)+u(n,k)) if u(n,k+1)+u(n,k) is even, and u(n,k+2) = abs(u(n,k+1)-u(n,k)) otherwise. Sequence gives integer values a(n) such that u(n,k)=1 for any k>=a(n).
A069211
Let u(n,k) be the recursion: u(n,1)=1, u(n,2)=n, u(n,k+2) = (1/2) * (u(n,k+1)+u(n,k)) if u(n,k+1)+u(n,k) is even, and u(n,k+2) = abs(u(n,k+1)-u(n,k)) otherwise. Sequence gives integer values a(n) such that u(n,k)=1 for any k>=a(n).
Terms
- a(0) =1a(1) =3a(2) =4a(3) =6a(4) =8a(5) =7a(6) =7a(7) =9a(8) =13a(9) =11a(10) =8a(11) =10a(12) =16a(13) =10a(14) =10a(15) =12a(16) =14a(17) =16a(18) =12a(19) =14a(20) =14a(21) =11a(22) =11a(23) =13a(24) =15a(25) =19a(26) =11a(27) =13a(28) =17a(29) =13
External references
- oeis: A069211