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.

A108451 Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1),U=(1,2), or d=(1,-1) and have k pyramids of the first kind (a pyramid of the first kind is a sequence u^pd^p for some positive integer p, starting at the x-axis).

Table of values

n a(n)
0 1
1 1
2 1
3 6
4 3
5 1
6 44
7 16
8 5
9 1
10 344
11 116
12 30
13 7
14 1
15 2856
16 928
17 224
18 48
19 9
20 1
21 24816
22 7856
23 1840
24 376
25 70
26 11
27 1
28 223016
29 69264
30 15912
31 3184
32 580
33 96
34 13
35 1
36 2056256
37 629472
38 142592
39 28176
40 5080
41 844
42 126
43 15
44 1
45 19344472
46 5855472
47 1312360
48 256992
49 46072

List of values

[1, 1, 1, 6, 3, 1, 44, 16, 5, 1, 344, 116, 30, 7, 1, 2856, 928, 224, 48, 9, 1, 24816, 7856, 1840, 376, 70, 11, 1, 223016, 69264, 15912, 3184, 580, 96, 13, 1, 2056256, 629472, 142592, 28176, 5080, 844, 126, 15, 1, 19344472, 5855472, 1312360, 256992, 46072]