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.

A347618 Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) is the number of partitions of n^k into n or more parts.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 0
6 1
7 1
8 1
9 0
10 1
11 1
12 4
13 1
14 0
15 1
16 1
17 21
18 25
19 1
20 0
21 1
22 1
23 230
24 2996
25 201
26 1
27 0
28 1
29 1
30 8348
31 18004286
32 1741256
33 1773
34 1
35 0
36 1
37 1
38 1741629
39 133978259344766
40 365749566865192
41 3163112106
42 16751
43 1
44 0
45 1
46 1
47 4351078599
48 233202632378520643600874780
49 61847822068260244309086870896081
50 1606903190858354687391986
51 15285150382556
52 165083
53 1
54 0

List of values

[1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 4, 1, 0, 1, 1, 21, 25, 1, 0, 1, 1, 230, 2996, 201, 1, 0, 1, 1, 8348, 18004286, 1741256, 1773, 1, 0, 1, 1, 1741629, 133978259344766, 365749566865192, 3163112106, 16751, 1, 0, 1, 1, 4351078599, 233202632378520643600874780, 61847822068260244309086870896081, 1606903190858354687391986, 15285150382556, 165083, 1, 0]