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.

A347621 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 distinct parts.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 1
6 1
7 1
8 1
9 1
10 1
11 1
12 2
13 2
14 1
15 1
16 1
17 6
18 8
19 2
20 1
21 1
22 1
23 32
24 192
25 32
26 3
27 1
28 1
29 1
30 390
31 84756
32 16444
33 142
34 4
35 1
36 1
37 1
38 16444
39 5807301632
40 11784471548
41 3207086
42 668
43 5
44 1
45 1
46 1
47 4013544
48 2496696209705056142
49 16816734263788624008200
50 74443865946867656
51 1258238720
52 3264
53 6
54 1

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 6, 8, 2, 1, 1, 1, 32, 192, 32, 3, 1, 1, 1, 390, 84756, 16444, 142, 4, 1, 1, 1, 16444, 5807301632, 11784471548, 3207086, 668, 5, 1, 1, 1, 4013544, 2496696209705056142, 16816734263788624008200, 74443865946867656, 1258238720, 3264, 6, 1]