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.

A369311 Square array A(n, k), n >= 0, k > 0, read by upwards antidiagonals: P(A(n, k)) is the remainder of the polynomial long division of P(n) by P(k) (where P(m) denotes the polynomial over GF(2) whose coefficients are encoded in the binary expansion of the nonnegative integer m).

Table of values

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

List of values

[0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 2, 1, 0, 0, 1, 1, 3, 2, 1, 0, 0, 0, 0, 0, 3, 2, 1, 0, 0, 1, 0, 1, 1, 3, 2, 1, 0, 0, 0, 1, 2, 0, 2, 3, 2, 1, 0, 0, 1, 1, 3, 3, 3, 3, 3, 2, 1, 0, 0, 0, 0, 0, 2, 0, 2, 4, 3, 2, 1, 0, 0, 1, 0, 1, 2, 1, 1, 5, 4, 3, 2, 1, 0]