Limit of the recursion B_[k] = T[k](B_[k-1]), where B_[1] = (1,2,3,4,5,...) and T[k] is the transformation that permutes the entries k(2i-1) + j and k(2i) + j for all j = 0,..,k-1 and positive integers i.
A065191
Limit of the recursion B_[k] = T[k](B_[k-1]), where B_[1] = (1,2,3,4,5,...) and T[k] is the transformation that permutes the entries k(2i-1) + j and k(2i) + j for all j = 0,..,k-1 and positive integers i.
Terms
- a(0) =1a(1) =4a(2) =8a(3) =3a(4) =5a(5) =16a(6) =18a(7) =19a(8) =11a(9) =2a(10) =40a(11) =13a(12) =15a(13) =10a(14) =24a(15) =29a(16) =37a(17) =50a(18) =12a(19) =9a(20) =63a(21) =28a(22) =66a(23) =7a(24) =33a(25) =60a(26) =22a(27) =31a(28) =35a(29) =44
External references
- oeis: A065191