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.

A216645 T(n,k)=Number of nondecreasing arrays of n 1..n integers with the sum of their k powers equal to sum(i^k,i=1..n).

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 1
6 2
7 1
8 1
9 1
10 5
11 1
12 1
13 1
14 1
15 12
16 1
17 1
18 1
19 1
20 1
21 32
22 1
23 1
24 1
25 1
26 1
27 3
28 94
29 1
30 1
31 1
32 1
33 1
34 2
35 8
36 289
37 1
38 1
39 1
40 1
41 1
42 1
43 2
44 25
45 910
46 1
47 1
48 1
49 1
50 1
51 1
52 2
53 6
54 83
55 2934
56 1
57 1
58 1
59 1
60 1
61 1
62 1
63 2
64 12
65 257
66 9686
67 1
68 1
69 1
70 1
71 1
72 1
73 1
74 1
75 5
76 30
77 788
78 32540
79 1
80 1
81 1
82 1
83 1
84 1
85 1
86 1
87 1
88 11
89 76
90 2491

List of values

[1, 1, 1, 1, 1, 2, 1, 1, 1, 5, 1, 1, 1, 1, 12, 1, 1, 1, 1, 1, 32, 1, 1, 1, 1, 1, 3, 94, 1, 1, 1, 1, 1, 2, 8, 289, 1, 1, 1, 1, 1, 1, 2, 25, 910, 1, 1, 1, 1, 1, 1, 2, 6, 83, 2934, 1, 1, 1, 1, 1, 1, 1, 2, 12, 257, 9686, 1, 1, 1, 1, 1, 1, 1, 1, 5, 30, 788, 32540, 1, 1, 1, 1, 1, 1, 1, 1, 1, 11, 76, 2491]