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.

A071946 Triangle T(n,k) 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 = (3,1).

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 2
5 2
6 1
7 4
8 6
9 6
10 1
11 6
12 13
13 19
14 19
15 1
16 8
17 23
18 44
19 63
20 63
21 1
22 10
23 37
24 87
25 156
26 219
27 219
28 1
29 12
30 55
31 155
32 330
33 568
34 787
35 787
36 1
37 14
38 77
39 255
40 629
41 1260
42 2110
43 2897
44 2897
45 1
46 16
47 103
48 395
49 1111
50 2527
51 4856
52 7972
53 10869
54 10869
55 1
56 18
57 133
58 583
59 1849
60 4706
61 10130
62 18889
63 30545
64 41414
65 41414

List of values

[1, 1, 1, 1, 2, 2, 1, 4, 6, 6, 1, 6, 13, 19, 19, 1, 8, 23, 44, 63, 63, 1, 10, 37, 87, 156, 219, 219, 1, 12, 55, 155, 330, 568, 787, 787, 1, 14, 77, 255, 629, 1260, 2110, 2897, 2897, 1, 16, 103, 395, 1111, 2527, 4856, 7972, 10869, 10869, 1, 18, 133, 583, 1849, 4706, 10130, 18889, 30545, 41414, 41414]