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.

A247310 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), (1,-2), where no segment is followed by a segment in the same direction.

Table of values

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

List of values

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