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.

A245558 Square array read by antidiagonals: T(n,k) = number of n-tuples of nonnegative integers (u_0,...,u_{n-1}) satisfying Sum_{j=0..n-1} j*u_j == 1 mod n and Sum_{j=0..n-1} u_j = m.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 1
6 1
7 1
8 2
9 2
10 1
11 1
12 2
13 3
14 2
15 1
16 1
17 3
18 5
19 5
20 3
21 1
22 1
23 3
24 7
25 8
26 7
27 3
28 1
29 1
30 4
31 9
32 14
33 14
34 9
35 4
36 1
37 1
38 4
39 12
40 20
41 25
42 20
43 12
44 4
45 1
46 1
47 5
48 15
49 30
50 42
51 42
52 30
53 15
54 5
55 1
56 1
57 5
58 18
59 40
60 66
61 75
62 66
63 40
64 18
65 5
66 1
67 1
68 6
69 22
70 55
71 99
72 132
73 132
74 99
75 55
76 22
77 6
78 1

List of values

[1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 2, 3, 2, 1, 1, 3, 5, 5, 3, 1, 1, 3, 7, 8, 7, 3, 1, 1, 4, 9, 14, 14, 9, 4, 1, 1, 4, 12, 20, 25, 20, 12, 4, 1, 1, 5, 15, 30, 42, 42, 30, 15, 5, 1, 1, 5, 18, 40, 66, 75, 66, 40, 18, 5, 1, 1, 6, 22, 55, 99, 132, 132, 99, 55, 22, 6, 1]