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.

A213126 Rows of triangle formed using Pascal's rule, except sums in the n-th row are modulo n: T(n,0) = T(n,n) = 1 and T(n,k) = (T(n-1,k-1) + T(n-1,k)) mod n.

Table of values

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

List of values

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