Limits of the recursion b(i+1)=B_[i](b(i)), where b(1)=n and B_[k+1](j) = B_[k](j), if j <= k; B_[k+1](j) = B_[k](j) + k, if j < k and (j mod 2k) >= k; B_[k+1](j) = B_[k](j) - k, if j < k and (j mod 2k) < k. Set a(n)=0 if b tends to infinity.
A065194
Limits of the recursion b(i+1)=B_[i](b(i)), where b(1)=n and B_[k+1](j) = B_[k](j), if j <= k; B_[k+1](j) = B_[k](j) + k, if j < k and (j mod 2k) >= k; B_[k+1](j) = B_[k](j) - k, if j < k and (j mod 2k) < k. Set a(n)=0 if b tends to infinity.
Terms
- a(0) =1a(1) =10a(2) =4a(3) =2a(4) =5a(5) =35a(6) =24a(7) =3a(8) =20a(9) =14a(10) =9a(11) =19a(12) =12a(13) =39a(14) =13a(15) =6a(16) =104a(17) =7a(18) =8a(19) =79a(20) =145a(21) =27a(22) =60a(23) =15a(24) =45a(25) =31a(26) =144a(27) =22a(28) =16a(29) =4339
External references
- oeis: A065194