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.

A238016 Number A(n,k) of partitions of n^k into parts that are at most n; square array A(n,k), n>=0, k>=0, read by antidiagonals.

Table of values

n a(n)
0 0
1 1
2 1
3 1
4 1
5 1
6 1
7 1
8 2
9 1
10 1
11 1
12 3
13 3
14 1
15 1
16 1
17 5
18 12
19 5
20 1
21 1
22 1
23 9
24 75
25 64
26 7
27 1
28 1
29 1
30 17
31 588
32 2280
33 377
34 11
35 1
36 1
37 1
38 33
39 5043
40 123464
41 106852
42 2432
43 15
44 1
45 1
46 1
47 65
48 44652
49 7566280
50 55567352
51 6889527
52 16475
53 22
54 1

List of values

[0, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 3, 1, 1, 1, 5, 12, 5, 1, 1, 1, 9, 75, 64, 7, 1, 1, 1, 17, 588, 2280, 377, 11, 1, 1, 1, 33, 5043, 123464, 106852, 2432, 15, 1, 1, 1, 65, 44652, 7566280, 55567352, 6889527, 16475, 22, 1]