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.

A247629 Triangular array: T(n,k) = number of paths from (0,0) to (n,k), each segment given by a vector (1,1), (1,-1), or (2,0), not crossing the x-axis.

Table of values

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

List of values

[1, 0, 1, 1, 0, 1, 0, 3, 0, 1, 4, 0, 5, 0, 1, 0, 12, 0, 7, 0, 1, 16, 0, 24, 0, 9, 0, 1, 0, 52, 0, 40, 0, 11, 0, 1, 68, 0, 116, 0, 60, 0, 13, 0, 1, 0, 236, 0, 216, 0, 84, 0, 15, 0, 1, 304, 0, 568, 0, 360, 0, 112, 0, 17, 0, 1, 0, 1108, 0, 1144, 0, 556, 0, 144]