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.

A355859 Triangle read by rows: T(n,k) = (n + k)/2 if (n + k) is congruent to 0 (mod 2), otherwise T(n,k) = 0; n >= 1, k >= 1.

Table of values

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

List of values

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