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.

A047070 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=2x unless x=0 or x=h.

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

List of values

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