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.

A047000 Array T read by diagonals; T(h,k)=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 step touches the line y=x/2 except at the endpoints.

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 1
14 1
15 1
16 4
17 5
18 2
19 2
20 1
21 1
22 5
23 9
24 7
25 4
26 3
27 1
28 1
29 6
30 14
31 16
32 7
33 3
34 4
35 1
36 1
37 7
38 20
39 30
40 23
41 7
42 7
43 5
44 1
45 1
46 8
47 27
48 50
49 53
50 30
51 14
52 12
53 6
54 1
55 1
56 9
57 35
58 77
59 103
60 83
61 30
62 12
63 18
64 7
65 1
66 1
67 10
68 44
69 112
70 180
71 186
72 113
73 30
74 30

List of values

[1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 3, 2, 1, 1, 1, 4, 5, 2, 2, 1, 1, 5, 9, 7, 4, 3, 1, 1, 6, 14, 16, 7, 3, 4, 1, 1, 7, 20, 30, 23, 7, 7, 5, 1, 1, 8, 27, 50, 53, 30, 14, 12, 6, 1, 1, 9, 35, 77, 103, 83, 30, 12, 18, 7, 1, 1, 10, 44, 112, 180, 186, 113, 30, 30]