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.

A026648 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 is odd, else T(n,k)=t(n-1,k-1)+T(n-1,k).

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 3
6 1
7 1
8 4
9 4
10 1
11 1
12 6
13 8
14 6
15 1
16 1
17 7
18 14
19 14
20 7
21 1
22 1
23 9
24 21
25 36
26 21
27 9
28 1
29 1
30 10
31 30
32 57
33 57
34 30
35 10
36 1
37 1
38 12
39 40
40 108
41 114
42 108
43 40
44 12
45 1
46 1
47 13
48 52
49 148
50 222
51 222
52 148
53 52
54 13
55 1
56 1
57 15
58 65
59 240
60 370
61 558
62 370
63 240
64 65
65 15
66 1
67 1
68 16

List of values

[1, 1, 1, 1, 3, 1, 1, 4, 4, 1, 1, 6, 8, 6, 1, 1, 7, 14, 14, 7, 1, 1, 9, 21, 36, 21, 9, 1, 1, 10, 30, 57, 57, 30, 10, 1, 1, 12, 40, 108, 114, 108, 40, 12, 1, 1, 13, 52, 148, 222, 222, 148, 52, 13, 1, 1, 15, 65, 240, 370, 558, 370, 240, 65, 15, 1, 1, 16]