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.

A108445 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 (a pyramid is a sequence u^pd^p or U^pd^(2p) for some positive integer p, starting at the x-axis).

Table of values

n a(n)
0 1
1 0
2 2
3 4
4 2
5 4
6 32
7 18
8 8
9 8
10 252
11 146
12 60
13 24
14 16
15 2112
16 1186
17 496
18 176
19 64
20 32
21 18484
22 10146
23 4148
24 1488
25 480
26 160
27 64
28 166976
29 90162
30 36216
31 12792
32 4160
33 1248
34 384
35 128
36 1545548
37 824114
38 326828
39 113960
40 36720
41 11104
42 3136
43 896
44 256
45 14583808
46 7699394

List of values

[1, 0, 2, 4, 2, 4, 32, 18, 8, 8, 252, 146, 60, 24, 16, 2112, 1186, 496, 176, 64, 32, 18484, 10146, 4148, 1488, 480, 160, 64, 166976, 90162, 36216, 12792, 4160, 1248, 384, 128, 1545548, 824114, 326828, 113960, 36720, 11104, 3136, 896, 256, 14583808, 7699394]