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.

A367416 Triangle read by rows: T(n,k) = number of solutions to +- 1^k +- 2^k +- 3^k +- ... +- n^k is a k-th power, n >= 2.

Table of values

n a(n)
2 4
3 8
4 1
5 16
6 1
7 32
8 0
9 2
10 64
11 6
12 128
13 8
14 256
15 16
16 4
17 512
18 26
19 1024
20 17
21 10
22 2048
23 67
24 4
25 3
26 4096
27 100
28 10
29 8192
30 137
31 34
32 6
33 16384
34 426
35 28
36 1
37 32768
38 661
39 96
40 6
41 65536
42 1351
43 146
44 16
45 8
46 131072
47 2637
48 230
49 15
50 262144
51 3831
52 258
53 40
54 524288
55 8095
56 1130
57 50

List of values

[4, 8, 1, 16, 1, 32, 0, 2, 64, 6, 128, 8, 256, 16, 4, 512, 26, 1024, 17, 10, 2048, 67, 4, 3, 4096, 100, 10, 8192, 137, 34, 6, 16384, 426, 28, 1, 32768, 661, 96, 6, 65536, 1351, 146, 16, 8, 131072, 2637, 230, 15, 262144, 3831, 258, 40, 524288, 8095, 1130, 50]