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.

A365623 T(n,k) is the number of parking functions of length n with cars parking at most k spots away from their preferred spot; square array T(n,k), n>=0, k>=0, read by downward antidiagonals.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 2
6 1
7 1
8 3
9 6
10 1
11 1
12 3
13 13
14 24
15 1
16 1
17 3
18 16
19 75
20 120
21 1
22 1
23 3
24 16
25 109
26 541
27 720
28 1
29 1
30 3
31 16
32 125
33 918
34 4683
35 5040
36 1
37 1
38 3
39 16
40 125
41 1171
42 9277
43 47293
44 40320
45 1
46 1
47 3
48 16
49 125
50 1296
51 12965
52 109438
53 545835
54 362880
55 1
56 1
57 3
58 16
59 125
60 1296
61 15511
62 166836
63 1475691
64 7087261
65 3628800

List of values

[1, 1, 1, 1, 1, 2, 1, 1, 3, 6, 1, 1, 3, 13, 24, 1, 1, 3, 16, 75, 120, 1, 1, 3, 16, 109, 541, 720, 1, 1, 3, 16, 125, 918, 4683, 5040, 1, 1, 3, 16, 125, 1171, 9277, 47293, 40320, 1, 1, 3, 16, 125, 1296, 12965, 109438, 545835, 362880, 1, 1, 3, 16, 125, 1296, 15511, 166836, 1475691, 7087261, 3628800]