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.

A026552 Irregular triangular array T read by rows: T(n, 0) = T(n, 2*n) = 1, T(n, 1) = T(n, 2*n-1) = floor(n/2 + 1), for even n >= 2, T(n, k) = T(n-1, k-2) + T(n-1, k-1) + T(n-1, k), otherwise T(n, k) = T(n-1, k-2) + T(n-1, k).

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 2
6 3
7 2
8 1
9 1
10 2
11 4
12 4
13 4
14 2
15 1
16 1
17 3
18 7
19 10
20 12
21 10
22 7
23 3
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 4
38 12
39 24
40 40
41 52
42 58
43 52
44 40
45 24
46 12
47 4
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 5
66 18
67 45
68 93
69 156
70 226
71 278

List of values

[1, 1, 1, 1, 1, 2, 3, 2, 1, 1, 2, 4, 4, 4, 2, 1, 1, 3, 7, 10, 12, 10, 7, 3, 1, 1, 3, 8, 13, 19, 20, 19, 13, 8, 3, 1, 1, 4, 12, 24, 40, 52, 58, 52, 40, 24, 12, 4, 1, 1, 4, 13, 28, 52, 76, 98, 104, 98, 76, 52, 28, 13, 4, 1, 1, 5, 18, 45, 93, 156, 226, 278]