A088803 - cp's OEIS frontend

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.

n	a(n)
1	1
2	3
3	7
4	11
5	17
6	25
7	33
8	41
9	53
10	65
11	77
12	93
13	109
14	123
15	143
16	163
17	181
18	203
19	227
20	249
21	277
22	303
23	329
24	357
25	389
26	417
27	451
28	485
29	517
30	555
31	593
32	629
33	669
34	711
35	749
36	795
37	839
38	883
39	931
40	981
41	1025
42	1077
43	1131
44	1179
45	1235
46	1293
47	1343
48	1403
49	1465
50	1519
51	1583
52	1649

[1, 3, 7, 11, 17, 25, 33, 41, 53, 65, 77, 93, 109, 123, 143, 163, 181, 203, 227, 249, 277, 303, 329, 357, 389, 417, 451, 485, 517, 555, 593, 629, 669, 711, 749, 795, 839, 883, 931, 981, 1025, 1077, 1131, 1179, 1235, 1293, 1343, 1403, 1465, 1519, 1583, 1649]

cp's OEIS Frontend

Table of values

List of values