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.

A049600 Array T read by diagonals; T(i,j) is the number of paths from (0,0) to (i,j) consisting of nonvertical segments (x(k),y(k))-to-(x(k+1),y(k+1)) such that 0 = x(1) < x(2) < ... < x(n-1) < x(n)=i, 0 = y(1) <= y(2) <= ... <= y(n-1) <= y(n)=j, for i >= 0, j >= 0.

Table of values

n a(n)
0 0
1 0
2 1
3 0
4 1
5 2
6 0
7 1
8 3
9 4
10 0
11 1
12 4
13 8
14 8
15 0
16 1
17 5
18 13
19 20
20 16
21 0
22 1
23 6
24 19
25 38
26 48
27 32
28 0
29 1
30 7
31 26
32 63
33 104
34 112
35 64
36 0
37 1
38 8
39 34
40 96
41 192
42 272
43 256
44 128
45 0
46 1
47 9
48 43
49 138
50 321
51 552
52 688
53 576
54 256
55 0
56 1
57 10
58 53
59 190
60 501
61 1002
62 1520
63 1696
64 1280
65 512

List of values

[0, 0, 1, 0, 1, 2, 0, 1, 3, 4, 0, 1, 4, 8, 8, 0, 1, 5, 13, 20, 16, 0, 1, 6, 19, 38, 48, 32, 0, 1, 7, 26, 63, 104, 112, 64, 0, 1, 8, 34, 96, 192, 272, 256, 128, 0, 1, 9, 43, 138, 321, 552, 688, 576, 256, 0, 1, 10, 53, 190, 501, 1002, 1520, 1696, 1280, 512]