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.

A362967 Number of nondecreasing partitions of n^2 into n parts from the intervals [1,n], [2,n+1], ..., [n,2n-1], respectively.

Table of values

n a(n)
0 1
1 1
2 2
3 5
4 17
5 66
6 294
7 1393
8 6965
9 36111
10 192850
11 1053894
12 5871306
13 33234990
14 190704140
15 1107086841
16 6492325565
17 38412063755
18 229052915708
19 1375396927729
20 8310509070747
21 50496841617102
22 308394124109340
23 1892137615326526
24 11658149626059204
25 72108088307308032
26 447590893613564372

List of values

[1, 1, 2, 5, 17, 66, 294, 1393, 6965, 36111, 192850, 1053894, 5871306, 33234990, 190704140, 1107086841, 6492325565, 38412063755, 229052915708, 1375396927729, 8310509070747, 50496841617102, 308394124109340, 1892137615326526, 11658149626059204, 72108088307308032, 447590893613564372]