cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A088804 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, from each pile with more than 1 token, one token is taken and added to the pile on its left and one is taken and added to the pile on its right. The redistributions in each step are done in parallel.

Table of values

n a(n)
1 1
2 4
3 8
4 14
5 21
6 29
7 39
8 51
9 63
10 77
11 93
12 110
13 128
14 148
15 170
16 192
17 216
18 242
19 268
20 296
21 326
22 358
23 390
24 424
25 460
26 496
27 534
28 574
29 615
30 657
31 701
32 747
33 793
34 841
35 891
36 941
37 993
38 1047
39 1103
40 1159
41 1217
42 1277
43 1337
44 1399
45 1463
46 1529
47 1595
48 1663
49 1733
50 1803
51 1875
52 1949

List of values

[1, 4, 8, 14, 21, 29, 39, 51, 63, 77, 93, 110, 128, 148, 170, 192, 216, 242, 268, 296, 326, 358, 390, 424, 460, 496, 534, 574, 615, 657, 701, 747, 793, 841, 891, 941, 993, 1047, 1103, 1159, 1217, 1277, 1337, 1399, 1463, 1529, 1595, 1663, 1733, 1803, 1875, 1949]