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.

A047130 Array read by descending antidiagonals: T(h,k) is the number of paths consisting of steps from (0,0) to (h,k) such that each step has length 1 directed up or right and no up-step crosses the line y = 3x/4. (Thus a path crosses the line only at lattice points and on right-steps.)

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 1
6 1
7 2
8 2
9 1
10 1
11 3
12 2
13 3
14 1
15 1
16 4
17 5
18 5
19 4
20 1
21 1
22 5
23 9
24 5
25 9
26 5
27 1
28 1
29 6
30 14
31 14
32 14
33 14
34 6
35 1
36 1
37 7
38 20
39 28
40 28
41 28
42 20
43 7
44 1
45 1
46 8
47 27
48 48
49 56
50 28
51 48
52 27
53 8
54 1
55 1
56 9
57 35
58 75
59 104
60 84
61 76
62 75
63 35
64 9
65 1
66 1
67 10
68 44
69 110
70 179
71 188
72 84

List of values

[1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 3, 2, 3, 1, 1, 4, 5, 5, 4, 1, 1, 5, 9, 5, 9, 5, 1, 1, 6, 14, 14, 14, 14, 6, 1, 1, 7, 20, 28, 28, 28, 20, 7, 1, 1, 8, 27, 48, 56, 28, 48, 27, 8, 1, 1, 9, 35, 75, 104, 84, 76, 75, 35, 9, 1, 1, 10, 44, 110, 179, 188, 84]