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.

A262809 Number A(n,k) of lattice paths from {n}^k to {0}^k using steps that decrement one or more components by one; 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 3
8 1
9 1
10 1
11 13
12 13
13 1
14 1
15 1
16 75
17 409
18 63
19 1
20 1
21 1
22 541
23 23917
24 16081
25 321
26 1
27 1
28 1
29 4683
30 2244361
31 10681263
32 699121
33 1683
34 1
35 1
36 1
37 47293
38 308682013
39 14638956721
40 5552351121
41 32193253
42 8989
43 1
44 1
45 1
46 545835
47 58514835289
48 35941784497263
49 117029959485121
50 3147728203035
51 1538743249
52 48639
53 1
54 1

List of values

[1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 13, 13, 1, 1, 1, 75, 409, 63, 1, 1, 1, 541, 23917, 16081, 321, 1, 1, 1, 4683, 2244361, 10681263, 699121, 1683, 1, 1, 1, 47293, 308682013, 14638956721, 5552351121, 32193253, 8989, 1, 1, 1, 545835, 58514835289, 35941784497263, 117029959485121, 3147728203035, 1538743249, 48639, 1, 1]