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.

A228154 T(n,k) is the number of s in {1,...,n}^n having longest contiguous subsequence with the same value of length k; triangle T(n,k), n>=1, 1<=k<=n, read by rows.

Table of values

n a(n)
1 1
2 2
3 2
4 12
5 12
6 3
7 108
8 120
9 24
10 4
11 1280
12 1520
13 280
14 40
15 5
16 18750
17 23400
18 3930
19 510
20 60
21 6
22 326592
23 423360
24 65016
25 7644
26 840
27 84
28 7
29 6588344
30 8800008
31 1241464
32 132552
33 13440
34 1288
35 112
36 8
37 150994944
38 206622720
39 26911296
40 2622528
41 244944
42 22032
43 1872
44 144
45 9

List of values

[1, 2, 2, 12, 12, 3, 108, 120, 24, 4, 1280, 1520, 280, 40, 5, 18750, 23400, 3930, 510, 60, 6, 326592, 423360, 65016, 7644, 840, 84, 7, 6588344, 8800008, 1241464, 132552, 13440, 1288, 112, 8, 150994944, 206622720, 26911296, 2622528, 244944, 22032, 1872, 144, 9]