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.

A298597 Number T(n,k) of times the value k appears on the parking functions of length n and such that if we replace that value k with k+1 we don't get a parking function.

Table of values

n a(n)
1 1
2 2
3 2
4 9
5 6
6 9
7 64
8 36
9 36
10 64
11 625
12 320
13 270
14 320
15 625
16 7776
17 3750
18 2880
19 2880
20 3750
21 7776
22 117649
23 54432
24 39375
25 35840
26 39375
27 54432
28 117649
29 2097152
30 941192
31 653184
32 560000
33 560000
34 653184
35 941192
36 2097152
37 43046721
38 18874368
39 12706092
40 10450944
41 9843750
42 10450944
43 12706092
44 18874368
45 43046721

List of values

[1, 2, 2, 9, 6, 9, 64, 36, 36, 64, 625, 320, 270, 320, 625, 7776, 3750, 2880, 2880, 3750, 7776, 117649, 54432, 39375, 35840, 39375, 54432, 117649, 2097152, 941192, 653184, 560000, 560000, 653184, 941192, 2097152, 43046721, 18874368, 12706092, 10450944, 9843750, 10450944, 12706092, 18874368, 43046721]