a(n) gives the number of steps taken in a process which manipulates piles of tokens arranged in a line. There are 2n (or 2n+1) tokens in all. Initially they are all in one pile. At each step every pile with more than 1 token is divided into two and half the token are added to the pile on the left and half to the pile on the right. If a pile has an odd number of tokens, the token left over stays where it is. The redistributions in each step are done in parallel.

A088803

a(n) gives the number of steps taken in a process which manipulates piles of tokens arranged in a line. There are 2n (or 2n+1) tokens in all. Initially they are all in one pile. At each step every pile with more than 1 token is divided into two and half the token are added to the pile on the left and half to the pile on the right. If a pile has an odd number of tokens, the token left over stays where it is. The redistributions in each step are done in parallel.

Terms

    a(0) =1a(1) =3a(2) =7a(3) =11a(4) =17a(5) =25a(6) =33a(7) =41a(8) =53a(9) =65a(10) =77a(11) =93a(12) =109a(13) =123a(14) =143a(15) =163a(16) =181a(17) =203a(18) =227a(19) =249a(20) =277a(21) =303a(22) =329a(23) =357a(24) =389a(25) =417a(26) =451a(27) =485a(28) =517a(29) =555

External references