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.

A114448 Array a(n,k) = n^k (mod k) read by antidiagonals (k>=1, n>=1).

Table of values

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

List of values

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