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.

A352747 Array read by ascending antidiagonals. A(n, k) = F(k, n) mod n for n >= 1 and k >= 0, where F(n, k) = A352744(n, k) are the Fibonacci numbers, A(0, k) = 1 for k >= 0.

Table of values

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

List of values

[1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 2, 0, 1, 0, 1, 3, 1, 2, 0, 0, 1, 5, 3, 0, 1, 1, 0, 1, 1, 1, 3, 3, 0, 0, 0, 1, 5, 0, 3, 3, 2, 2, 1, 0, 1, 3, 2, 6, 5, 3, 1, 1, 0, 0, 1, 4, 1, 7, 5, 1, 3, 0, 0, 1, 0, 1, 0, 9, 8, 4, 4, 3, 3, 3, 2, 0, 0, 1, 5, 1, 4, 6, 1, 3, 5, 3, 2, 1, 1, 0, 1]