A228273 - cp's OEIS frontend

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

n	a(n)
0	1
1	0
2	1
3	0
4	2
5	2
6	0
7	18
8	6
9	3
10	0
11	192
12	48
13	12
14	4
15	0
16	2500
17	500
18	100
19	20
20	5
21	0
22	38880
23	6480
24	1080
25	180
26	30
27	6
28	0
29	705894
30	100842
31	14406
32	2058
33	294
34	42
35	7
36	0
37	14680064
38	1835008
39	229376
40	28672
41	3584
42	448
43	56
44	8
45	0
46	344373768
47	38263752
48	4251528
49	472392
50	52488
51	5832
52	648
53	72
54	9

[1, 0, 1, 0, 2, 2, 0, 18, 6, 3, 0, 192, 48, 12, 4, 0, 2500, 500, 100, 20, 5, 0, 38880, 6480, 1080, 180, 30, 6, 0, 705894, 100842, 14406, 2058, 294, 42, 7, 0, 14680064, 1835008, 229376, 28672, 3584, 448, 56, 8, 0, 344373768, 38263752, 4251528, 472392, 52488, 5832, 648, 72, 9]

cp's OEIS Frontend

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

Table of values

List of values