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.

A026637 Triangular array T read by rows: T(n,0) = T(n,n) = 1 for n >= 0, T(n,1) = T(n,n-1) = floor((3*n-1)/2) for n >= 1, otherwise T(n,k) = T(n-1,k-1) + T(n-1,k) for 2 <= k <= n-2, n >= 4.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 2
5 1
6 1
7 4
8 4
9 1
10 1
11 5
12 8
13 5
14 1
15 1
16 7
17 13
18 13
19 7
20 1
21 1
22 8
23 20
24 26
25 20
26 8
27 1
28 1
29 10
30 28
31 46
32 46
33 28
34 10
35 1
36 1
37 11
38 38
39 74
40 92
41 74
42 38
43 11
44 1
45 1
46 13
47 49
48 112
49 166
50 166
51 112
52 49
53 13
54 1
55 1
56 14
57 62
58 161
59 278
60 332
61 278
62 161
63 62
64 14
65 1
66 1
67 16
68 76
69 223
70 439
71 610
72 610
73 439
74 223
75 76
76 16
77 1

List of values

[1, 1, 1, 1, 2, 1, 1, 4, 4, 1, 1, 5, 8, 5, 1, 1, 7, 13, 13, 7, 1, 1, 8, 20, 26, 20, 8, 1, 1, 10, 28, 46, 46, 28, 10, 1, 1, 11, 38, 74, 92, 74, 38, 11, 1, 1, 13, 49, 112, 166, 166, 112, 49, 13, 1, 1, 14, 62, 161, 278, 332, 278, 161, 62, 14, 1, 1, 16, 76, 223, 439, 610, 610, 439, 223, 76, 16, 1]