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.

A238012 Number A(n,k) of partitions of k^n into parts that are at most n with at least one part of each size; square array A(n,k), n>=0, k>=0, read by antidiagonals.

Table of values

n a(n)
0 0
1 0
2 0
3 0
4 1
5 0
6 0
7 1
8 0
9 0
10 0
11 1
12 1
13 0
14 0
15 0
16 1
17 4
18 2
19 0
20 0
21 0
22 1
23 7
24 48
25 9
26 0
27 0
28 0
29 1
30 12
31 310
32 3042
33 119
34 0
35 0
36 0
37 1
38 17
39 1240
40 109809
41 1067474
42 4935
43 0
44 0
45 0
46 1
47 24
48 3781
49 1655004
50 370702459
51 2215932130
52 596763
53 0
54 0
55 0
56 1
57 31
58 9633
59 14942231
60 32796849930
61 13173778523786
62 29012104252380
63 211517867
64 0
65 0

List of values

[0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 4, 2, 0, 0, 0, 1, 7, 48, 9, 0, 0, 0, 1, 12, 310, 3042, 119, 0, 0, 0, 1, 17, 1240, 109809, 1067474, 4935, 0, 0, 0, 1, 24, 3781, 1655004, 370702459, 2215932130, 596763, 0, 0, 0, 1, 31, 9633, 14942231, 32796849930, 13173778523786, 29012104252380, 211517867, 0, 0]