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.

A228617 T(n,k) is the number of s in {1,...,n}^n having shortest run with the same value of length k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

Table of values

n a(n)
0 1
1 0
2 1
3 0
4 2
5 2
6 0
7 24
8 0
9 3
10 0
11 240
12 12
13 0
14 4
15 0
16 3080
17 40
18 0
19 0
20 5
21 0
22 46410
23 210
24 30
25 0
26 0
27 6
28 0
29 822612
30 840
31 84
32 0
33 0
34 0
35 7
36 0
37 16771832
38 5208
39 112
40 56
41 0
42 0
43 0
44 8
45 0
46 387395856
47 23760
48 720
49 144
50 0
51 0
52 0
53 0
54 9
55 0
56 9999848700
57 148410
58 2610
59 180
60 90
61 0
62 0
63 0
64 0
65 10

List of values

[1, 0, 1, 0, 2, 2, 0, 24, 0, 3, 0, 240, 12, 0, 4, 0, 3080, 40, 0, 0, 5, 0, 46410, 210, 30, 0, 0, 6, 0, 822612, 840, 84, 0, 0, 0, 7, 0, 16771832, 5208, 112, 56, 0, 0, 0, 8, 0, 387395856, 23760, 720, 144, 0, 0, 0, 0, 9, 0, 9999848700, 148410, 2610, 180, 90, 0, 0, 0, 0, 10]