A356254 - cp's OEIS frontend

A356254 Given n balls, all of which are initially in the first of n numbered boxes, a(n) is the number of steps required to get one ball in each box when a step consists of moving to the next box every second ball from the highest-numbered box that has more than one ball.

n	a(n)
1	0
2	1
3	3
4	5
5	9
6	13
7	18
8	23
9	31
10	39
11	47
12	56
13	67
14	78
15	91
16	103
17	119
18	135
19	150
20	167
21	185
22	203
23	223
24	243
25	266
26	289
27	313
28	337
29	364
30	391
31	420
32	447
33	479
34	511
35	541
36	574
37	607
38	640
39	675
40	711
41	749
42	787
43	826
44	865
45	907
46	949
47	993
48	1036
49	1083
50	1130
51	1177
52	1225
53	1275
54	1325
55	1377

[0, 1, 3, 5, 9, 13, 18, 23, 31, 39, 47, 56, 67, 78, 91, 103, 119, 135, 150, 167, 185, 203, 223, 243, 266, 289, 313, 337, 364, 391, 420, 447, 479, 511, 541, 574, 607, 640, 675, 711, 749, 787, 826, 865, 907, 949, 993, 1036, 1083, 1130, 1177, 1225, 1275, 1325, 1377]

cp's OEIS Frontend

A356254 Given n balls, all of which are initially in the first of n numbered boxes, a(n) is the number of steps required to get one ball in each box when a step consists of moving to the next box every second ball from the highest-numbered box that has more than one ball.

Table of values

List of values