A264909 - cp's OEIS frontend

A264909 Number A(n,k) of k-ascent sequences of length n with no consecutive repeated letters; square array A(n,k), n>=0, k>=0, read by antidiagonals.

n	a(n)
0	1
1	1
2	1
3	1
4	1
5	0
6	1
7	1
8	1
9	0
10	1
11	1
12	2
13	2
14	0
15	1
16	1
17	3
18	6
19	5
20	0
21	1
22	1
23	4
24	12
25	21
26	16
27	0
28	1
29	1
30	5
31	20
32	54
33	87
34	61
35	0
36	1
37	1
38	6
39	30
40	110
41	276
42	413
43	271
44	0
45	1
46	1
47	7
48	42
49	195
50	670
51	1574
52	2213
53	1372
54	0
55	1
56	1
57	8
58	56
59	315
60	1380
61	4470
62	9916
63	13205
64	7795
65	0

[1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 2, 2, 0, 1, 1, 3, 6, 5, 0, 1, 1, 4, 12, 21, 16, 0, 1, 1, 5, 20, 54, 87, 61, 0, 1, 1, 6, 30, 110, 276, 413, 271, 0, 1, 1, 7, 42, 195, 670, 1574, 2213, 1372, 0, 1, 1, 8, 56, 315, 1380, 4470, 9916, 13205, 7795, 0]

cp's OEIS Frontend

A264909 Number A(n,k) of k-ascent sequences of length n with no consecutive repeated letters; square array A(n,k), n>=0, k>=0, read by antidiagonals.

Table of values

List of values