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.

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

Table of values

n a(n)
0 1
1 1
2 13
3 588
4 53089
5 7431069
6 1432812535
7 354709605775
8 107681683621061
9 38815870525676822
10 16224696168627992214
11 7722681288635179285337
12 4126484069454572889453794
13 2446850787696893234909546422
14 1594892857383186062141424302309

List of values

[1, 1, 13, 588, 53089, 7431069, 1432812535, 354709605775, 107681683621061, 38815870525676822, 16224696168627992214, 7722681288635179285337, 4126484069454572889453794, 2446850787696893234909546422, 1594892857383186062141424302309]

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

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