A292879 - cp's OEIS frontend

A292879 Triangle read by rows: T(n,k) (n>=1, 4<=k<=n+3) is the number of k-sequences of balls colored with at most n colors such that exactly three balls are of a color seen previously in the sequence.

n	a(n)
1	1
2	2
3	30
4	3
5	90
6	540
7	4
8	180
9	2160
10	8400
11	5
12	300
13	5400
14	42000
15	126000
16	6
17	450
18	10800
19	126000
20	756000
21	1905120
22	7
23	630
24	18900
25	294000
26	2646000
27	13335840
28	29635200
29	8
30	840
31	30240
32	588000
33	7056000
34	53343360
35	237081600
36	479001600
37	9
38	1080
39	45360
40	1058400
41	15876000
42	160030080
43	1066867200
44	4311014400
45	8083152000

[1, 2, 30, 3, 90, 540, 4, 180, 2160, 8400, 5, 300, 5400, 42000, 126000, 6, 450, 10800, 126000, 756000, 1905120, 7, 630, 18900, 294000, 2646000, 13335840, 29635200, 8, 840, 30240, 588000, 7056000, 53343360, 237081600, 479001600, 9, 1080, 45360, 1058400, 15876000, 160030080, 1066867200, 4311014400, 8083152000]

cp's OEIS Frontend

A292879 Triangle read by rows: T(n,k) (n>=1, 4<=k<=n+3) is the number of k-sequences of balls colored with at most n colors such that exactly three balls are of a color seen previously in the sequence.

Table of values

List of values