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.

A347617 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 exactly n parts.

Table of values

n a(n)
0 0
1 1
2 1
3 1
4 1
5 0
6 1
7 1
8 1
9 0
10 1
11 1
12 2
13 1
14 0
15 1
16 1
17 4
18 7
19 1
20 0
21 1
22 1
23 8
24 61
25 34
26 1
27 0
28 1
29 1
30 16
31 547
32 1906
33 192
34 1
35 0
36 1
37 1
38 32
39 4921
40 117874
41 91606
42 1206
43 1
44 0
45 1
46 1
47 64
48 44287
49 7478386
50 53830967
51 6023602
52 8033
53 1
54 0
55 1
56 1
57 128
58 398581
59 477568114
60 33219689231
61 43054503928
62 505853354
63 55974
64 1
65 0

List of values

[0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 2, 1, 0, 1, 1, 4, 7, 1, 0, 1, 1, 8, 61, 34, 1, 0, 1, 1, 16, 547, 1906, 192, 1, 0, 1, 1, 32, 4921, 117874, 91606, 1206, 1, 0, 1, 1, 64, 44287, 7478386, 53830967, 6023602, 8033, 1, 0, 1, 1, 128, 398581, 477568114, 33219689231, 43054503928, 505853354, 55974, 1, 0]