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.

A247352 Rectangular array read by upwards by columns: T = T(n,k) = number of paths from (0,1) 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 0
1 1
2 0
3 0
4 1
5 0
6 1
7 1
8 0
9 2
10 2
11 1
12 2
13 2
14 3
15 4
16 2
17 5
18 8
19 5
20 5
21 10
22 12
23 13
24 10
25 17
26 28
27 22
28 17
29 38
30 49
31 45
32 38
33 66
34 100
35 87
36 66
37 138
38 191
39 166
40 138
41 257
42 370
43 329
44 257
45 508
46 724
47 627
48 508
49 981
50 1392
51 1232
52 981
53 1900
54 2721
55 2373
56 1900
57 3702
58 5254
59 4621
60 3702

List of values

[0, 1, 0, 0, 1, 0, 1, 1, 0, 2, 2, 1, 2, 2, 3, 4, 2, 5, 8, 5, 5, 10, 12, 13, 10, 17, 28, 22, 17, 38, 49, 45, 38, 66, 100, 87, 66, 138, 191, 166, 138, 257, 370, 329, 257, 508, 724, 627, 508, 981, 1392, 1232, 981, 1900, 2721, 2373, 1900, 3702, 5254, 4621, 3702]