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.

A258672 Number of partitions of n*2^n into parts that are at most n.

Table of values

n a(n)
0 0
1 1
2 5
3 61
4 2280
5 273052
6 110537709
7 156456474138
8 790541795804221
9 14445283925963101577
10 963056085414756870071490
11 235864774408401842540220265704
12 213426797830699546133563821747980513
13 717147073290996884137625501875655000693923

List of values

[0, 1, 5, 61, 2280, 273052, 110537709, 156456474138, 790541795804221, 14445283925963101577, 963056085414756870071490, 235864774408401842540220265704, 213426797830699546133563821747980513, 717147073290996884137625501875655000693923]