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.

A258668 Number of partitions of (n-1)! into parts that are at most n.

Table of values

n a(n)
0 0
1 1
2 1
3 2
4 9
5 333
6 436140
7 43079658188
8 416768277321177570
9 479533252041533318548951081
10 82915824358567616469138110469031459201
11 2733701379858734057121091262990514105871808751388190
12 21440005073020480325389224271234447054906430340227337359088146738881

List of values

[0, 1, 1, 2, 9, 333, 436140, 43079658188, 416768277321177570, 479533252041533318548951081, 82915824358567616469138110469031459201, 2733701379858734057121091262990514105871808751388190, 21440005073020480325389224271234447054906430340227337359088146738881]