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.

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

Table of values

n a(n)
0 1
1 0
2 0
3 0
4 1
5 0
6 1
7 1
8 1
9 1
10 2
11 2
12 2
13 4
14 3
15 4
16 6
17 6
18 6
19 12
20 10
21 12
22 20
23 18
24 20
25 36
26 32
27 36
28 64
29 56
30 64
31 112
32 100
33 112
34 200
35 176
36 200
37 352
38 312
39 352
40 624
41 552
42 624
43 1104
44 976
45 1104
46 1952
47 1728
48 1952
49 3456
50 3056
51 3456
52 6112
53 5408
54 6112
55 10816
56 9568
57 10816

List of values

[1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 2, 2, 2, 4, 3, 4, 6, 6, 6, 12, 10, 12, 20, 18, 20, 36, 32, 36, 64, 56, 64, 112, 100, 112, 200, 176, 200, 352, 312, 352, 624, 552, 624, 1104, 976, 1104, 1952, 1728, 1952, 3456, 3056, 3456, 6112, 5408, 6112, 10816, 9568, 10816]