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.

A026692 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 k or n-k is of form 2h for h=1,2,...,[ n/4 ], 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 2
6 1
7 1
8 3
9 3
10 1
11 1
12 4
13 8
14 4
15 1
16 1
17 5
18 15
19 15
20 5
21 1
22 1
23 6
24 24
25 30
26 24
27 6
28 1
29 1
30 7
31 35
32 54
33 54
34 35
35 7
36 1
37 1
38 8
39 48
40 89
41 138
42 89
43 48
44 8
45 1
46 1
47 9
48 63
49 137
50 281
51 281
52 137
53 63
54 9
55 1
56 1
57 10
58 80
59 200
60 507
61 562
62 507
63 200
64 80
65 10
66 1
67 1
68 11
69 99
70 280
71 844

List of values

[1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 1, 4, 8, 4, 1, 1, 5, 15, 15, 5, 1, 1, 6, 24, 30, 24, 6, 1, 1, 7, 35, 54, 54, 35, 7, 1, 1, 8, 48, 89, 138, 89, 48, 8, 1, 1, 9, 63, 137, 281, 281, 137, 63, 9, 1, 1, 10, 80, 200, 507, 562, 507, 200, 80, 10, 1, 1, 11, 99, 280, 844]