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.

A259799 Array read by antidiagonals upwards: T(n,k) = number of partitions of k^n into n-th powers (n>=1, k>=0).

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 1
6 2
7 1
8 1
9 2
10 3
11 1
12 1
13 2
14 4
15 5
16 1
17 1
18 2
19 5
20 8
21 7
22 1
23 1
24 2
25 7
26 17
27 19
28 11
29 1
30 1
31 2
32 9
33 36
34 62
35 43
36 15
37 1
38 1
39 2
40 13
41 88
42 253
43 258
44 98
45 22
46 1
47 1
48 2
49 19
50 218
51 1104
52 1886
53 1050
54 220
55 30
56 1
57 1
58 2
59 27
60 550
61 5082
62 15772
63 14800
64 4365
65 504
66 42
67 1
68 1
69 2
70 40
71 1413
72 24119
73 140549
74 241582
75 118238
76 18012
77 1116
78 56

List of values

[1, 1, 1, 1, 1, 2, 1, 1, 2, 3, 1, 1, 2, 4, 5, 1, 1, 2, 5, 8, 7, 1, 1, 2, 7, 17, 19, 11, 1, 1, 2, 9, 36, 62, 43, 15, 1, 1, 2, 13, 88, 253, 258, 98, 22, 1, 1, 2, 19, 218, 1104, 1886, 1050, 220, 30, 1, 1, 2, 27, 550, 5082, 15772, 14800, 4365, 504, 42, 1, 1, 2, 40, 1413, 24119, 140549, 241582, 118238, 18012, 1116, 56]