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.

A247311 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,0), (1,-1).

Table of values

n a(n)
0 1
1 0
2 0
3 1
4 1
5 0
6 2
7 2
8 1
9 4
10 5
11 3
12 9
13 12
14 8
15 21
16 29
17 20
18 50
19 70
20 49
21 120
22 169
23 119
24 289
25 408
26 288
27 697
28 985
29 696
30 1682
31 2378
32 1681
33 4060
34 5741
35 4059
36 9801
37 13860
38 9800
39 23661
40 33461
41 23660
42 57122
43 80782
44 57121
45 137904
46 195025
47 137903
48 332929
49 470832
50 332928

List of values

[1, 0, 0, 1, 1, 0, 2, 2, 1, 4, 5, 3, 9, 12, 8, 21, 29, 20, 50, 70, 49, 120, 169, 119, 289, 408, 288, 697, 985, 696, 1682, 2378, 1681, 4060, 5741, 4059, 9801, 13860, 9800, 23661, 33461, 23660, 57122, 80782, 57121, 137904, 195025, 137903, 332929, 470832, 332928]