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.

A047150 Array 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 up-step crosses the line y=5x/3. (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 2
5 1
6 1
7 1
8 3
9 1
10 1
11 2
12 4
13 4
14 1
15 1
16 3
17 6
18 8
19 5
20 1
21 1
22 4
23 3
24 14
25 13
26 6
27 1
28 1
29 5
30 7
31 17
32 27
33 19
34 7
35 1
36 1
37 6
38 12
39 24
40 44
41 46
42 26
43 8
44 1
45 1
46 7
47 18
48 36
49 68
50 90
51 72
52 34
53 9
54 1
55 1
56 8
57 25
58 54
59 104
60 158
61 162
62 106
63 43
64 10
65 1
66 1
67 9
68 33
69 79
70 54
71 262
72 320

List of values

[1, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 2, 4, 4, 1, 1, 3, 6, 8, 5, 1, 1, 4, 3, 14, 13, 6, 1, 1, 5, 7, 17, 27, 19, 7, 1, 1, 6, 12, 24, 44, 46, 26, 8, 1, 1, 7, 18, 36, 68, 90, 72, 34, 9, 1, 1, 8, 25, 54, 104, 158, 162, 106, 43, 10, 1, 1, 9, 33, 79, 54, 262, 320]