A292930 - cp's OEIS frontend

A292930 Triangle read by rows: T(n,k) (n>=1, 3<=k<=n+2) is the number of k-sequences of balls colored with at most n colors such that exactly three balls are the same color as some other ball in the sequence.

n	a(n)
1	1
2	2
3	8
4	3
5	24
6	60
7	4
8	48
9	240
10	480
11	5
12	80
13	600
14	2400
15	4200
16	6
17	120
18	1200
19	7200
20	25200
21	40320
22	7
23	168
24	2100
25	16800
26	88200
27	282240
28	423360
29	8
30	224
31	3360
32	33600
33	235200
34	1128960
35	3386880
36	4838400
37	9
38	288
39	5040
40	60480
41	529200
42	3386880
43	15240960
44	43545600
45	59875200
46	10
47	360
48	7200
49	100800
50	1058400
51	8467200
52	50803200
53	217728000
54	598752000
55	798336000

[1, 2, 8, 3, 24, 60, 4, 48, 240, 480, 5, 80, 600, 2400, 4200, 6, 120, 1200, 7200, 25200, 40320, 7, 168, 2100, 16800, 88200, 282240, 423360, 8, 224, 3360, 33600, 235200, 1128960, 3386880, 4838400, 9, 288, 5040, 60480, 529200, 3386880, 15240960, 43545600, 59875200, 10, 360, 7200, 100800, 1058400, 8467200, 50803200, 217728000, 598752000, 798336000]

cp's OEIS Frontend

A292930 Triangle read by rows: T(n,k) (n>=1, 3<=k<=n+2) is the number of k-sequences of balls colored with at most n colors such that exactly three balls are the same color as some other ball in the sequence.

Table of values

List of values