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.

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

Table of values

n a(n)
0 1
1 0
2 0
3 0
4 0
5 1
6 1
7 0
8 1
9 1
10 1
11 2
12 1
13 2
14 4
15 2
16 2
17 5
18 5
19 6
20 5
21 7
22 13
23 10
24 7
25 18
26 22
27 20
28 18
29 29
30 45
31 40
32 29
33 63
34 87
35 74
36 63
37 116
38 166
39 150
40 116
41 229
42 329
43 282
44 229
45 445
46 627
47 558
48 445
49 856
50 1232
51 1072
52 856
53 1677
54 2373
55 2088
56 1677
57 3229
58 4621
59 4050
60 3229

List of values

[1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 2, 1, 2, 4, 2, 2, 5, 5, 6, 5, 7, 13, 10, 7, 18, 22, 20, 18, 29, 45, 40, 29, 63, 87, 74, 63, 116, 166, 150, 116, 229, 329, 282, 229, 445, 627, 558, 445, 856, 1232, 1072, 856, 1677, 2373, 2088, 1677, 3229, 4621, 4050, 3229]