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.

A210472 Number A(n,k) of paths starting at {n}^k to a border position where one component equals 0 using steps that decrement one component by 1; square array A(n,k), n>=0, k>=0, read by antidiagonals.

Table of values

n a(n)
0 0
1 1
2 0
3 1
4 1
5 0
6 1
7 2
8 1
9 0
10 1
11 3
12 6
13 1
14 0
15 1
16 4
17 33
18 20
19 1
20 0
21 1
22 5
23 196
24 543
25 70
26 1
27 0
28 1
29 6
30 1305
31 22096
32 10497
33 252
34 1
35 0
36 1
37 7
38 9786
39 1304045
40 3323092
41 220503
42 924
43 1
44 0
45 1
46 8
47 82201
48 106478916
49 1971644785
50 574346824
51 4870401
52 3432
53 1
54 0

List of values

[0, 1, 0, 1, 1, 0, 1, 2, 1, 0, 1, 3, 6, 1, 0, 1, 4, 33, 20, 1, 0, 1, 5, 196, 543, 70, 1, 0, 1, 6, 1305, 22096, 10497, 252, 1, 0, 1, 7, 9786, 1304045, 3323092, 220503, 924, 1, 0, 1, 8, 82201, 106478916, 1971644785, 574346824, 4870401, 3432, 1, 0]