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.

A071943 Triangle T(n,k) (n>=0, 0 <= k <= n) read by rows giving number of underdiagonal lattice paths from (0,0) to (n,k) using only steps R=(1,0), V=(0,1) and D=(1,2).

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 2
5 3
6 1
7 3
8 7
9 9
10 1
11 4
12 12
13 24
14 31
15 1
16 5
17 18
18 46
19 89
20 113
21 1
22 6
23 25
24 76
25 183
26 342
27 431
28 1
29 7
30 33
31 115
32 323
33 741
34 1355
35 1697
36 1
37 8
38 42
39 164
40 520
41 1376
42 3054
43 5492
44 6847
45 1
46 9
47 52
48 224
49 786
50 2326
51 5900
52 12768
53 22669
54 28161
55 1
56 10
57 63
58 296
59 1134
60 3684
61 10370

List of values

[1, 1, 1, 1, 2, 3, 1, 3, 7, 9, 1, 4, 12, 24, 31, 1, 5, 18, 46, 89, 113, 1, 6, 25, 76, 183, 342, 431, 1, 7, 33, 115, 323, 741, 1355, 1697, 1, 8, 42, 164, 520, 1376, 3054, 5492, 6847, 1, 9, 52, 224, 786, 2326, 5900, 12768, 22669, 28161, 1, 10, 63, 296, 1134, 3684, 10370]