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.

A363071 Number of partitions of [n] into m blocks that are ordered with increasing least elements and where block j contains n+1-j (m in {0..ceiling(n/2)}, j in {1..m}).

Table of values

n a(n)
0 1
1 1
2 1
3 2
4 3
5 6
6 13
7 31
8 80
9 222
10 659
11 2082
12 6966
13 24574
14 91067
15 353443
16 1432909
17 6054025
18 26599192
19 121295345
20 573065538
21 2800640187
22 14137645933
23 73619324824
24 394979697320
25 2180911872495
26 12380240599262
27 72181691321844
28 431857838950302
29 2649144684462775

List of values

[1, 1, 1, 2, 3, 6, 13, 31, 80, 222, 659, 2082, 6966, 24574, 91067, 353443, 1432909, 6054025, 26599192, 121295345, 573065538, 2800640187, 14137645933, 73619324824, 394979697320, 2180911872495, 12380240599262, 72181691321844, 431857838950302, 2649144684462775]