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.

A247051 Rectangular array read upwards by columns: T = T(n,k) = number of paths from (0,2) to (n,k), where 0 <= k <= 2, consisting of segments given by the vectors (1,1), (1,2), (1,-1).

Table of values

n a(n)
0 0
1 0
2 1
3 0
4 1
5 0
6 1
7 0
8 1
9 0
10 2
11 1
12 2
13 1
14 2
15 1
16 4
17 3
18 4
19 4
20 5
21 4
22 9
23 8
24 9
25 12
26 13
27 12
28 22
29 21
30 22
31 33
32 34
33 33
34 56
35 55
36 56
37 88
38 89
39 88
40 145
41 144
42 145
43 232
44 233
45 232
46 378
47 377
48 378
49 609
50 610
51 609
52 988
53 987
54 988
55 1596
56 1597
57 1596
58 2585
59 2584
60 2585
61 4180
62 4181

List of values

[0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 2, 1, 2, 1, 2, 1, 4, 3, 4, 4, 5, 4, 9, 8, 9, 12, 13, 12, 22, 21, 22, 33, 34, 33, 56, 55, 56, 88, 89, 88, 145, 144, 145, 232, 233, 232, 378, 377, 378, 609, 610, 609, 988, 987, 988, 1596, 1597, 1596, 2585, 2584, 2585, 4180, 4181]