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.

A294207 Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,k), 0 <= 3k <= 2n, that are below the line 3y=2x, only touching at the end points.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 2
6 2
7 1
8 3
9 3
10 1
11 4
12 7
13 7
14 1
15 5
16 12
17 19
18 19
19 1
20 6
21 18
22 37
23 37
24 1
25 7
26 25
27 62
28 99
29 99
30 1
31 8
32 33
33 95
34 194
35 293
36 293
37 1
38 9
39 42
40 137
41 331
42 624
43 624
44 1
45 10
46 52
47 189
48 520
49 1144
50 1768
51 1768
52 1
53 11
54 63
55 252
56 772
57 1916
58 3684
59 5452
60 5452

List of values

[1, 1, 1, 1, 1, 2, 2, 1, 3, 3, 1, 4, 7, 7, 1, 5, 12, 19, 19, 1, 6, 18, 37, 37, 1, 7, 25, 62, 99, 99, 1, 8, 33, 95, 194, 293, 293, 1, 9, 42, 137, 331, 624, 624, 1, 10, 52, 189, 520, 1144, 1768, 1768, 1, 11, 63, 252, 772, 1916, 3684, 5452, 5452]