A275662 - cp's OEIS frontend

A275662 Triangle read by rows: T(n,k) = number of convex domino towers with n dominoes having widest row with k dominoes.

n	a(n)
1	1
2	3
3	1
4	7
5	6
6	1
7	15
8	18
9	7
10	1
11	31
12	48
13	17
14	9
15	1
16	63
17	109
18	49
19	20
20	11
21	1
22	127
23	240
24	115
25	52
26	24
27	13
28	1
29	255
30	498
31	258
32	122
33	61
34	28
35	15
36	1
37	511
38	1026
39	551
40	261
41	136
42	71
43	32
44	17
45	1
46	1023
47	2065
48	1163
49	531
50	298
51	157
52	81
53	36
54	19
55	1

[1, 3, 1, 7, 6, 1, 15, 18, 7, 1, 31, 48, 17, 9, 1, 63, 109, 49, 20, 11, 1, 127, 240, 115, 52, 24, 13, 1, 255, 498, 258, 122, 61, 28, 15, 1, 511, 1026, 551, 261, 136, 71, 32, 17, 1, 1023, 2065, 1163, 531, 298, 157, 81, 36, 19, 1]

cp's OEIS Frontend

A275662 Triangle read by rows: T(n,k) = number of convex domino towers with n dominoes having widest row with k dominoes.

Table of values

List of values