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.

A075435 T(n,k) = right- or upward-moving paths connecting opposite corners of an n X n chessboard, visiting the diagonal at k points between start and finish.

Table of values

n a(n)
2 2
3 6
4 4
5 20
6 24
7 8
8 70
9 116
10 72
11 16
12 252
13 520
14 456
15 192
16 32
17 924
18 2248
19 2496
20 1504
21 480
22 64
23 3432
24 9520
25 12624
26 9728
27 4480
28 1152
29 128
30 12870
31 39796
32 60792
33 56400
34 33440
35 12480
36 2688
37 256
38 48620
39 164904
40 283208
41 304704
42 218720
43 105600
44 33152
45 6144

List of values

[2, 6, 4, 20, 24, 8, 70, 116, 72, 16, 252, 520, 456, 192, 32, 924, 2248, 2496, 1504, 480, 64, 3432, 9520, 12624, 9728, 4480, 1152, 128, 12870, 39796, 60792, 56400, 33440, 12480, 2688, 256, 48620, 164904, 283208, 304704, 218720, 105600, 33152, 6144]