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.

A001522 Number of n-stacks with strictly receding walls, or the number of Type A partitions of n in the sense of Auluck (1951).

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 2
5 3
6 5
7 7
8 10
9 14
10 19
11 26
12 35
13 47
14 62
15 82
16 107
17 139
18 179
19 230
20 293
21 372
22 470
23 591
24 740
25 924
26 1148
27 1422
28 1756
29 2161
30 2651
31 3244
32 3957
33 4815
34 5844
35 7075
36 8545
37 10299
38 12383
39 14859
40 17794
41 21267
42 25368
43 30207
44 35902
45 42600
46 50462
47 59678
48 70465
49 83079
50 97800
51 114967
52 134956
53 158205
54 185209
55 216546
56 252859

List of values

[1, 1, 1, 1, 2, 3, 5, 7, 10, 14, 19, 26, 35, 47, 62, 82, 107, 139, 179, 230, 293, 372, 470, 591, 740, 924, 1148, 1422, 1756, 2161, 2651, 3244, 3957, 4815, 5844, 7075, 8545, 10299, 12383, 14859, 17794, 21267, 25368, 30207, 35902, 42600, 50462, 59678, 70465, 83079, 97800, 114967, 134956, 158205, 185209, 216546, 252859]