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.

A026519 Irregular triangular array T read by rows: T(n, k) = T(n-1, k-2) + T(n-1, k) if (n mod 2) = 0, otherwise T(n-1, k-2) + T(n-1, k-1) + T(n-1, k), with T(n, 0) = T(n, 2*n) = 1, T(n, 1) = T(n, 2*n-1) = floor((n+1)/2).

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 4, 4, 4, 2, 1, 1, 2, 5, 6, 8, 6, 5, 2, 1, 1, 3, 8, 13, 19, 20, 19, 13, 8, 3, 1, 1, 3, 9, 16, 27, 33, 38, 33, 27, 16, 9, 3, 1, 1, 4, 13, 28, 52, 76, 98, 104, 98, 76, 52, 28, 13, 4, 1, 1, 4, 14, 32, 65, 104, 150, 180, 196, 180, 150, 104, 65, 32, 14, 4, 1]