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.

A292729 a(n) is the maximum number of steps that can occur during the following procedure: start with n piles each containing one stone; any number of stones can be transferred between piles of equal size.

Table of values

n a(n)
1 0
2 1
3 1
4 3
5 4
6 4
7 8
8 10
9 11
10 12
11 16
12 20
13 22
14 24
15 27
16 31
17 35
18 38
19 43
20 45
21 47
22 52
23 57
24 62
25 67
26 71
27 74
28 79
29 83
30 90
31 95
32 101
33 106
34 111
35 114
36 118
37 126
38 132
39 138
40 146
41 152
42 156
43 161
44 167
45 172
46 180
47 189
48 194
49 204
50 208
51 216
52 221
53 228
54 234
55 242
56 249
57 258
58 264
59 274
60 282

List of values

[0, 1, 1, 3, 4, 4, 8, 10, 11, 12, 16, 20, 22, 24, 27, 31, 35, 38, 43, 45, 47, 52, 57, 62, 67, 71, 74, 79, 83, 90, 95, 101, 106, 111, 114, 118, 126, 132, 138, 146, 152, 156, 161, 167, 172, 180, 189, 194, 204, 208, 216, 221, 228, 234, 242, 249, 258, 264, 274, 282]