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.

A292726 a(n) is the number of states that can be achieved when starting from n piles each containing one stone, where any number of stones can be transferred between piles that start with the same number of stones.

Table of values

n a(n)
1 1
2 2
3 2
4 5
5 6
6 8
7 14
8 22
9 27
10 38
11 55
12 70
13 100
14 130
15 167
16 231
17 296
18 371
19 489
20 618
21 775
22 995
23 1254
24 1549
25 1951
26 2428
27 2980
28 3707
29 4564
30 5549
31 6841
32 8349
33 10085
34 12300
35 14862
36 17894
37 21636
38 26004
39 31082
40 37308
41 44582
42 53024
43 63260
44 75160
45 88931
46 105545
47 124753
48 147034
49 173510
50 204174

List of values

[1, 2, 2, 5, 6, 8, 14, 22, 27, 38, 55, 70, 100, 130, 167, 231, 296, 371, 489, 618, 775, 995, 1254, 1549, 1951, 2428, 2980, 3707, 4564, 5549, 6841, 8349, 10085, 12300, 14862, 17894, 21636, 26004, 31082, 37308, 44582, 53024, 63260, 75160, 88931, 105545, 124753, 147034, 173510, 204174]