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.

A238608 Number of partitions of n^3 into parts that are at most n.

Table of values

n a(n)
0 1
1 1
2 5
3 75
4 2280
5 106852
6 6889527
7 569704489
8 57733506640
9 6944433285769
10 968356321790171
11 153738253618009045
12 27396489338187214000
13 5417302365503826145732
14 1177436831956414016252071
15 279074576444362385794783853
16 71649589941044468875380333533

List of values

[1, 1, 5, 75, 2280, 106852, 6889527, 569704489, 57733506640, 6944433285769, 968356321790171, 153738253618009045, 27396489338187214000, 5417302365503826145732, 1177436831956414016252071, 279074576444362385794783853, 71649589941044468875380333533]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.