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.

A247050 Rectangular array read upwards by columns: T = T(n,k) = number of paths from (0,1) 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 1
2 0
3 1
4 0
5 1
6 0
7 2
8 1
9 2
10 1
11 2
12 1
13 4
14 3
15 4
16 4
17 5
18 4
19 9
20 8
21 9
22 12
23 13
24 12
25 22
26 21
27 22
28 33
29 34
30 33
31 56
32 55
33 56
34 88
35 89
36 88
37 145
38 144
39 145
40 232
41 233
42 232
43 378
44 377
45 378
46 609
47 610
48 609
49 988
50 987
51 988
52 1596
53 1597
54 1596
55 2585
56 2584
57 2585
58 4180
59 4181
60 4180

List of values

[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, 4180]