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.

A097692 Triangle read by rows: a(n,k) = number of paths of n upsteps U and n downsteps D that contain k UDUs.

Table of values

n a(n)
0 1
1 2
2 4
3 2
4 10
5 8
6 2
7 26
8 30
9 12
10 2
11 70
12 104
13 60
14 16
15 2
16 192
17 350
18 260
19 100
20 20
21 2
22 534
23 1152
24 1050
25 520
26 150
27 24
28 2
29 1500
30 3738
31 4032
32 2450
33 910
34 210
35 28
36 2
37 4246
38 12000
39 14952
40 10752
41 4900
42 1456
43 280
44 32
45 2
46 12092
47 38214
48 54000
49 44856
50 24192
51 8820
52 2184
53 360
54 36
55 2

List of values

[1, 2, 4, 2, 10, 8, 2, 26, 30, 12, 2, 70, 104, 60, 16, 2, 192, 350, 260, 100, 20, 2, 534, 1152, 1050, 520, 150, 24, 2, 1500, 3738, 4032, 2450, 910, 210, 28, 2, 4246, 12000, 14952, 10752, 4900, 1456, 280, 32, 2, 12092, 38214, 54000, 44856, 24192, 8820, 2184, 360, 36, 2]