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.

A214868 Triangle 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-1,k) if k = [n/2] or k = [(n+1)/2], else T(n,k) = T(n-1,k-1) + T(n-2,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 5
14 1
15 1
16 7
17 11
18 11
19 7
20 1
21 1
22 9
23 23
24 22
25 23
26 9
27 1
28 1
29 11
30 39
31 45
32 45
33 39
34 11
35 1
36 1
37 13
38 59
39 107
40 90
41 107
42 59
43 13
44 1
45 1
46 15
47 83
48 205
49 197
50 197
51 205
52 83
53 15
54 1

List of values

[1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 1, 5, 6, 5, 1, 1, 7, 11, 11, 7, 1, 1, 9, 23, 22, 23, 9, 1, 1, 11, 39, 45, 45, 39, 11, 1, 1, 13, 59, 107, 90, 107, 59, 13, 1, 1, 15, 83, 205, 197, 197, 205, 83, 15, 1]