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.

A026736 Triangular array T read by rows: T(n,0) = T(n,n) = 1 for n >= 0; for n >= 2 and 1 <= k <= n-1, T(n,k) = T(n-1,k-1) + T(n-2,k-1) + T(n-1,k) if n is even and k=(n-2)/2, otherwise T(n,k) = T(n-1,k-1) + T(n-1,k).

Table of values

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

List of values

[1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 1, 5, 6, 4, 1, 1, 6, 11, 10, 5, 1, 1, 7, 22, 21, 15, 6, 1, 1, 8, 29, 43, 36, 21, 7, 1, 1, 9, 37, 94, 79, 57, 28, 8, 1, 1, 10, 46, 131, 173, 136, 85, 36, 9, 1, 1, 11, 56, 177, 398, 309, 221, 121, 45, 10, 1, 1, 12, 67, 233, 575, 707, 530, 342, 166, 55, 11, 1]