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.

A258299 Number of partitions of n*(n-1)*(n-2) into parts that are at most n.

Table of values

n a(n)
0 1
1 1
2 1
3 7
4 169
5 7166
6 436140
7 34690401
8 3418486403
9 402588217564
10 55217486292383
11 8650673262689142
12 1524827150449505994
13 298774748146352115019
14 64436825369109396329518
15 15171417879016739747222223
16 3872658124805520661780283663
17 1065387724298834666633864592587

List of values

[1, 1, 1, 7, 169, 7166, 436140, 34690401, 3418486403, 402588217564, 55217486292383, 8650673262689142, 1524827150449505994, 298774748146352115019, 64436825369109396329518, 15171417879016739747222223, 3872658124805520661780283663, 1065387724298834666633864592587]