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.

A166279 Triangle, read by rows: T(0,0) = 1, T(n,k) = T(n-1,k-1) (mod 2) + T(n-1,k) (mod 2), T(n,k) = 0 if k < 0 or k > n.

Table of values

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

List of values

[1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 2, 2, 1, 1, 1, 0, 0, 1, 1, 1, 2, 1, 0, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 2, 1, 0, 0, 0, 0, 0, 1, 2, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 1, 0, 0, 0, 1, 2, 2, 2, 1]