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.

A055450 Path-counting array T; each step of a path is (1 right) or (1 up) to a point below line y=x, else (1 right and 1 up) or (1 up) to a point on the line y=x, else (1 left) or (1 up) to a point above line y=x. T(i,j)=number of paths to point (i-j,j), for 1<=j<=i, i >= 1.

Table of values

n a(n)
0 1
1 1
2 3
3 1
4 2
5 10
6 1
7 3
8 7
9 36
10 1
11 4
12 5
13 26
14 137
15 1
16 5
17 9
18 19
19 101
20 543
21 1
22 6
23 14
24 14
25 75
26 406
27 2219
28 1
29 7
30 20
31 28
32 56
33 305
34 1676
35 9285
36 1
37 8
38 27
39 48
40 42
41 230
42 1270
43 7066
44 39587
45 1
46 9
47 35
48 75
49 90
50 174
51 965
52 5390
53 30302
54 171369
55 1
56 10
57 44
58 110
59 165
60 132
61 735
62 4120
63 23236
64 131782
65 751236

List of values

[1, 1, 3, 1, 2, 10, 1, 3, 7, 36, 1, 4, 5, 26, 137, 1, 5, 9, 19, 101, 543, 1, 6, 14, 14, 75, 406, 2219, 1, 7, 20, 28, 56, 305, 1676, 9285, 1, 8, 27, 48, 42, 230, 1270, 7066, 39587, 1, 9, 35, 75, 90, 174, 965, 5390, 30302, 171369, 1, 10, 44, 110, 165, 132, 735, 4120, 23236, 131782, 751236]