A256816 - cp's OEIS frontend

A256816 T(n,k) = Number of length n+k 0..1 arrays with at most two downsteps in every k consecutive neighbor pairs.

n	a(n)
1	4
2	8
3	8
4	16
5	16
6	16
7	32
8	32
9	32
10	32
11	63
12	64
13	64
14	64
15	64
16	120
17	124
18	128
19	128
20	128
21	128
22	219
23	229
24	245
25	256
26	256
27	256
28	256
29	382
30	402
31	442
32	484
33	512
34	512
35	512
36	512
37	638
38	673
39	753
40	856
41	956
42	1024
43	1024
44	1024
45	1024
46	1024
47	1080
48	1220
49	1424
50	1656
51	1888
52	2048
53	2048
54	2048

[4, 8, 8, 16, 16, 16, 32, 32, 32, 32, 63, 64, 64, 64, 64, 120, 124, 128, 128, 128, 128, 219, 229, 245, 256, 256, 256, 256, 382, 402, 442, 484, 512, 512, 512, 512, 638, 673, 753, 856, 956, 1024, 1024, 1024, 1024, 1024, 1080, 1220, 1424, 1656, 1888, 2048, 2048, 2048]

cp's OEIS Frontend

A256816 T(n,k) = Number of length n+k 0..1 arrays with at most two downsteps in every k consecutive neighbor pairs.

Table of values

List of values