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.

A247622 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, and including no horizontal segment on 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 3
11 0
12 5
13 0
14 1
15 0
16 11
17 0
18 7
19 0
20 1
21 11
22 0
23 23
24 0
25 9
26 0
27 1
28 0
29 45
30 0
31 39
32 0
33 11
34 0
35 1
36 45
37 0
38 107
39 0
40 59
41 0
42 13
43 0
44 1
45 0
46 197
47 0
48 205
49 0
50 83
51 0
52 15
53 0
54 1
55 197
56 0
57 509
58 0
59 347
60 0
61 111
62 0
63 17
64 0
65 1
66 0
67 903
68 0
69 1061
70 0
71 541
72 0
73 143
74 0

List of values

[1, 0, 1, 1, 0, 1, 0, 3, 0, 1, 3, 0, 5, 0, 1, 0, 11, 0, 7, 0, 1, 11, 0, 23, 0, 9, 0, 1, 0, 45, 0, 39, 0, 11, 0, 1, 45, 0, 107, 0, 59, 0, 13, 0, 1, 0, 197, 0, 205, 0, 83, 0, 15, 0, 1, 197, 0, 509, 0, 347, 0, 111, 0, 17, 0, 1, 0, 903, 0, 1061, 0, 541, 0, 143, 0]