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.

A299807 Rectangular array read by antidiagonals: T(n,k) is the number of distinct sums of k complex n-th roots of 1, n >= 1, k >= 0.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 2
6 1
7 1
8 3
9 3
10 1
11 1
12 4
13 6
14 4
15 1
16 1
17 5
18 9
19 10
20 5
21 1
22 1
23 6
24 15
25 16
26 15
27 6
28 1
29 1
30 7
31 19
32 35
33 25
34 21
35 7
36 1
37 1
38 8
39 28
40 37
41 70
42 36
43 28
44 8
45 1
46 1
47 9
48 33
49 84
50 61
51 126
52 49
53 36
54 9
55 1
56 1
57 10
58 45
59 96
60 210
61 91
62 210
63 64
64 45
65 10
66 1
67 1
68 11
69 51
70 163
71 225
72 462
73 127
74 330
75 81
76 55
77 11
78 1
79 1
80 12
81 66
82 180
83 477
84 456
85 924
86 169
87 495
88 100
89 66

List of values

[1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 1, 4, 6, 4, 1, 1, 5, 9, 10, 5, 1, 1, 6, 15, 16, 15, 6, 1, 1, 7, 19, 35, 25, 21, 7, 1, 1, 8, 28, 37, 70, 36, 28, 8, 1, 1, 9, 33, 84, 61, 126, 49, 36, 9, 1, 1, 10, 45, 96, 210, 91, 210, 64, 45, 10, 1, 1, 11, 51, 163, 225, 462, 127, 330, 81, 55, 11, 1, 1, 12, 66, 180, 477, 456, 924, 169, 495, 100, 66]