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.

A026725 Triangular array, T, read by rows: T(n,0) = T(n,n) = 1. 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 odd and k=n/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 4
8 3
9 1
10 1
11 5
12 7
13 4
14 1
15 1
16 6
17 16
18 11
19 5
20 1
21 1
22 7
23 22
24 27
25 16
26 6
27 1
28 1
29 8
30 29
31 65
32 43
33 22
34 7
35 1
36 1
37 9
38 37
39 94
40 108
41 65
42 29
43 8
44 1
45 1
46 10
47 46
48 131
49 267
50 173
51 94
52 37
53 9
54 1
55 1
56 11
57 56
58 177
59 398
60 440
61 267
62 131
63 46
64 10
65 1
66 1
67 12
68 67
69 233

List of values

[1, 1, 1, 1, 2, 1, 1, 4, 3, 1, 1, 5, 7, 4, 1, 1, 6, 16, 11, 5, 1, 1, 7, 22, 27, 16, 6, 1, 1, 8, 29, 65, 43, 22, 7, 1, 1, 9, 37, 94, 108, 65, 29, 8, 1, 1, 10, 46, 131, 267, 173, 94, 37, 9, 1, 1, 11, 56, 177, 398, 440, 267, 131, 46, 10, 1, 1, 12, 67, 233]