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.

A247049 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), (1,2), (1,-1).

Table of values

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

List of values

[1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 5, 5, 5, 8, 8, 8, 13, 13, 13, 21, 21, 21, 34, 34, 34, 55, 55, 55, 89, 89, 89, 144, 144, 144, 233, 233, 233, 377, 377, 377, 610, 610, 610, 987, 987, 987, 1597, 1597, 1597, 2584, 2584, 2584, 4181, 4181, 4181]