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.

A027052 Triangular array T read by rows: T(n,0) = T(n,2n) = 1 for n >= 0, T(n,1)=0 for n >= 1, T(n,2)=1 for n >= 2 and for n >= 3, T(n,k) = T(n-1,k-3) + T(n-1, k-2) + T(n-1,k-1) for 3 <= k <= 2n-1. T(n,k)=0 for k < 0 or k > 2n.

Table of values

n a(n)
0 1
1 1
2 0
3 1
4 1
5 0
6 1
7 2
8 1
9 1
10 0
11 1
12 2
13 3
14 4
15 1
16 1
17 0
18 1
19 2
20 3
21 6
22 9
23 8
24 1
25 1
26 0
27 1
28 2
29 3
30 6
31 11
32 18
33 23
34 18
35 1
36 1
37 0
38 1
39 2
40 3
41 6
42 11
43 20
44 35
45 52
46 59
47 42
48 1
49 1
50 0
51 1
52 2
53 3
54 6
55 11
56 20
57 37
58 66
59 107
60 146
61 153
62 102
63 1
64 1
65 0
66 1
67 2
68 3
69 6
70 11
71 20
72 37
73 68
74 123
75 210
76 319
77 406
78 401
79 256
80 1

List of values

[1, 1, 0, 1, 1, 0, 1, 2, 1, 1, 0, 1, 2, 3, 4, 1, 1, 0, 1, 2, 3, 6, 9, 8, 1, 1, 0, 1, 2, 3, 6, 11, 18, 23, 18, 1, 1, 0, 1, 2, 3, 6, 11, 20, 35, 52, 59, 42, 1, 1, 0, 1, 2, 3, 6, 11, 20, 37, 66, 107, 146, 153, 102, 1, 1, 0, 1, 2, 3, 6, 11, 20, 37, 68, 123, 210, 319, 406, 401, 256, 1]