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.

A371568 Array read by ascending antidiagonals: A(n, k) is the number of paths of length k in Z^n from the origin to points such that x1+x2+...+xn = k with x1,...,xn > 0.

Table of values

n a(n)
1 1
2 0
3 1
4 0
5 2
6 1
7 0
8 0
9 6
10 1
11 0
12 0
13 6
14 14
15 1
16 0
17 0
18 0
19 36
20 30
21 1
22 0
23 0
24 0
25 24
26 150
27 62
28 1
29 0
30 0
31 0
32 0
33 240
34 540
35 126
36 1
37 0
38 0
39 0
40 0
41 120
42 1560
43 1806
44 254
45 1
46 0
47 0
48 0
49 0
50 1800
51 8400
52 5796
53 510
54 1

List of values

[1, 0, 1, 0, 2, 1, 0, 0, 6, 1, 0, 0, 6, 14, 1, 0, 0, 0, 36, 30, 1, 0, 0, 0, 24, 150, 62, 1, 0, 0, 0, 0, 240, 540, 126, 1, 0, 0, 0, 0, 120, 1560, 1806, 254, 1, 0, 0, 0, 0, 1800, 8400, 5796, 510, 1]