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.

A374440 Triangle read by rows: T(n, k) = T(n - 1, k) + T(n - 2, k - 2), with boundary conditions: if k = 0 or k = 2 then T = 1; if k = 1 then T = n - 1.

Table of values

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

List of values

[1, 1, 0, 1, 1, 1, 1, 2, 1, 0, 1, 3, 1, 1, 1, 1, 4, 1, 3, 2, 0, 1, 5, 1, 6, 3, 1, 1, 1, 6, 1, 10, 4, 4, 3, 0, 1, 7, 1, 15, 5, 10, 6, 1, 1, 1, 8, 1, 21, 6, 20, 10, 5, 4, 0, 1, 9, 1, 28, 7, 35, 15, 15, 10, 1, 1, 1, 10, 1, 36, 8, 56, 21, 35, 20, 6, 5, 0]