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.

A316675 Triangle read by rows: T(n,k) gives the number of ways to stack n triangles in a valley so that the right wall has k triangles for n >= 0 and 0 <= k <= n.

Table of values

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

List of values

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