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.

A238010 Number A(n,k) of partitions of k^n 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 0
2 1
3 0
4 1
5 1
6 0
7 1
8 1
9 1
10 0
11 1
12 3
13 1
14 1
15 0
16 1
17 5
18 10
19 1
20 1
21 0
22 1
23 9
24 75
25 64
26 1
27 1
28 0
29 1
30 13
31 374
32 4410
33 831
34 1
35 1
36 0
37 1
38 19
39 1365
40 123464
41 1366617
42 26207
43 1
44 1
45 0
46 1
47 25
48 3997
49 1736385
50 393073019
51 2559274110
52 2239706
53 1
54 1

List of values

[0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 3, 1, 1, 0, 1, 5, 10, 1, 1, 0, 1, 9, 75, 64, 1, 1, 0, 1, 13, 374, 4410, 831, 1, 1, 0, 1, 19, 1365, 123464, 1366617, 26207, 1, 1, 0, 1, 25, 3997, 1736385, 393073019, 2559274110, 2239706, 1, 1]