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.

A367820 Number of partitions of [2n] that have at most one block contained in [n].

Table of values

n a(n)
0 1
1 2
2 13
3 153
4 2744
5 68303
6 2224417
7 90995838
8 4538437039
9 269755223485
10 18766884323562
11 1506040068195721
12 137740473851280141
13 14212098473767962472
14 1640078704487165930485
15 210103319793655159244093
16 29684467774817808296383256
17 4598958815992575305097910699

List of values

[1, 2, 13, 153, 2744, 68303, 2224417, 90995838, 4538437039, 269755223485, 18766884323562, 1506040068195721, 137740473851280141, 14212098473767962472, 1640078704487165930485, 210103319793655159244093, 29684467774817808296383256, 4598958815992575305097910699]