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.

A316674 Number A(n,k) of paths from {0}^k to {n}^k that always move closer to {n}^k; 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 2
9 1
10 1
11 13
12 26
13 4
14 1
15 1
16 75
17 818
18 252
19 8
20 1
21 1
22 541
23 47834
24 64324
25 2568
26 16
27 1
28 1
29 4683
30 4488722
31 42725052
32 5592968
33 26928
34 32
35 1
36 1
37 47293
38 617364026
39 58555826884
40 44418808968
41 515092048
42 287648
43 64
44 1

List of values

[1, 1, 1, 1, 1, 1, 1, 3, 2, 1, 1, 13, 26, 4, 1, 1, 75, 818, 252, 8, 1, 1, 541, 47834, 64324, 2568, 16, 1, 1, 4683, 4488722, 42725052, 5592968, 26928, 32, 1, 1, 47293, 617364026, 58555826884, 44418808968, 515092048, 287648, 64, 1]