A333650 - cp's OEIS frontend

A333650 Triangle read by rows: T(n,k) gives the number of domino towers of height k consisting of n bricks.

n	a(n)
1	1
2	1
3	2
4	1
5	4
6	4
7	1
8	7
9	11
10	8
11	1
12	12
13	24
14	28
15	16
16	1
17	20
18	52
19	70
20	68
21	32
22	1
23	33
24	110
25	168
26	193
27	160
28	64
29	1
30	54
31	228
32	401
33	497
34	510
35	368
36	128
37	1
38	88
39	467
40	944
41	1257
42	1412
43	1304
44	832
45	256
46	1
47	143
48	949
49	2187
50	3172
51	3736
52	3879
53	3248
54	1856
55	512

[1, 1, 2, 1, 4, 4, 1, 7, 11, 8, 1, 12, 24, 28, 16, 1, 20, 52, 70, 68, 32, 1, 33, 110, 168, 193, 160, 64, 1, 54, 228, 401, 497, 510, 368, 128, 1, 88, 467, 944, 1257, 1412, 1304, 832, 256, 1, 143, 949, 2187, 3172, 3736, 3879, 3248, 1856, 512]

cp's OEIS Frontend

A333650 Triangle read by rows: T(n,k) gives the number of domino towers of height k consisting of n bricks.

Table of values

List of values