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.

A340591 Number A(n,k) of n*(k+1)-step k-dimensional nonnegative closed lattice walks starting at the origin and using steps that increment all components or decrement one component by 1; square array A(n,k), n>=0, k>=0, read by antidiagonals.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 1
6 1
7 2
8 2
9 1
10 1
11 6
12 16
13 5
14 1
15 1
16 24
17 288
18 192
19 14
20 1
21 1
22 120
23 9216
24 24444
25 2816
26 42
27 1
28 1
29 720
30 460800
31 7303104
32 2738592
33 46592
34 132
35 1
36 1
37 5040
38 33177600
39 4234233600
40 8204167296
41 361998432
42 835584
43 429
44 1
45 1
46 40320
47 3251404800
48 4223111040000
49 59027412643200
50 11332298092032
51 53414223552
52 15876096
53 1430
54 1

List of values

[1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 6, 16, 5, 1, 1, 24, 288, 192, 14, 1, 1, 120, 9216, 24444, 2816, 42, 1, 1, 720, 460800, 7303104, 2738592, 46592, 132, 1, 1, 5040, 33177600, 4234233600, 8204167296, 361998432, 835584, 429, 1, 1, 40320, 3251404800, 4223111040000, 59027412643200, 11332298092032, 53414223552, 15876096, 1430, 1]