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.

A347147 Square array read by antidiagonals: T(n,k) is the number of rook paths from (1,1) to (n,k) if the rook may travel 1 to i squares along rank or file i, n >= 1, k >= 1.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 2
6 1
7 1
8 4
9 4
10 1
11 1
12 7
13 10
14 7
15 1
16 1
17 12
18 23
19 23
20 12
21 1
22 1
23 20
24 50
25 62
26 50
27 20
28 1
29 1
30 33
31 104
32 156
33 156
34 104
35 33
36 1
37 1
38 54
39 211
40 373
41 438
42 373
43 211
44 54
45 1
46 1
47 88
48 420
49 859
50 1155
51 1155
52 859
53 420
54 88
55 1
56 1
57 143
58 824
59 1925
60 2915
61 3306
62 2915
63 1925
64 824
65 143
66 1

List of values

[1, 1, 1, 1, 2, 1, 1, 4, 4, 1, 1, 7, 10, 7, 1, 1, 12, 23, 23, 12, 1, 1, 20, 50, 62, 50, 20, 1, 1, 33, 104, 156, 156, 104, 33, 1, 1, 54, 211, 373, 438, 373, 211, 54, 1, 1, 88, 420, 859, 1155, 1155, 859, 420, 88, 1, 1, 143, 824, 1925, 2915, 3306, 2915, 1925, 824, 143, 1]