Define b(k) by the recursion b(1)=n, b(k+1)=b(k)-trunc(k/b(k)), where trunc(x) is floor(x) for x>=0, ceiling(x) for x<0. Sequence gives the value a(n) such that b(a(n))=0; if k>a(n) then b(k) is undefined.
A073339
Define b(k) by the recursion b(1)=n, b(k+1)=b(k)-trunc(k/b(k)), where trunc(x) is floor(x) for x>=0, ceiling(x) for x<0. Sequence gives the value a(n) such that b(a(n))=0; if k>a(n) then b(k) is undefined.
Terms
- a(0) =2a(1) =5a(2) =5a(3) =69a(4) =69a(5) =12a(6) =69a(7) =69a(8) =69a(9) =29a(10) =69a(11) =19a(12) =69a(13) =69a(14) =29a(15) =29a(16) =631a(17) =28a(18) =30a(19) =631a(20) =69a(21) =69a(22) =69a(23) =631a(24) =72a(25) =42a(26) =1167a(27) =631a(28) =72a(29) =631
External references
- oeis: A073339