A144428 - cp's OEIS frontend

A144428 Square array read by ascending antidiagonals. A(L, n) is a table of sequences representing the number of valid nodes in level n of a labeled binary tree when the labeling rule forbids 1 of the 2^L states given by the last L digits of the parent label.

n	a(n)
1	2
2	2
3	3
4	2
5	4
6	5
7	2
8	4
9	7
10	8
11	2
12	4
13	8
14	13
15	13
16	2
17	4
18	8
19	15
20	24
21	21
22	2
23	4
24	8
25	16
26	29
27	44
28	34
29	2
30	4
31	8
32	16
33	31
34	56
35	81
36	55
37	2
38	4
39	8
40	16
41	32
42	61
43	108
44	149
45	89
46	2
47	4
48	8
49	16
50	32
51	63
52	120
53	208
54	274
55	144
56	2
57	4
58	8
59	16
60	32
61	64
62	125
63	236
64	401
65	504
66	233
67	2
68	4
69	8
70	16
71	32
72	64
73	127
74	248
75	464
76	773
77	927
78	377
79	2
80	4
81	8
82	16
83	32
84	64
85	128
86	253

[2, 2, 3, 2, 4, 5, 2, 4, 7, 8, 2, 4, 8, 13, 13, 2, 4, 8, 15, 24, 21, 2, 4, 8, 16, 29, 44, 34, 2, 4, 8, 16, 31, 56, 81, 55, 2, 4, 8, 16, 32, 61, 108, 149, 89, 2, 4, 8, 16, 32, 63, 120, 208, 274, 144, 2, 4, 8, 16, 32, 64, 125, 236, 401, 504, 233, 2, 4, 8, 16, 32, 64, 127, 248, 464, 773, 927, 377, 2, 4, 8, 16, 32, 64, 128, 253]

cp's OEIS Frontend

A144428 Square array read by ascending antidiagonals. A(L, n) is a table of sequences representing the number of valid nodes in level n of a labeled binary tree when the labeling rule forbids 1 of the 2^L states given by the last L digits of the parent label.

Table of values

List of values

n	a(n)
1	2
2	2
3	3
4	2
5	4
6	5
7	2
8	4
9	7
10	8
11	2
12	4
13	8
14	13
15	13
16	2
17	4
18	8
19	15
20	24
21	21
22	2
23	4
24	8
25	16
26	29
27	44
28	34
29	2
30	4
31	8
32	16
33	31
34	56
35	81
36	55
37	2
38	4
39	8
40	16
41	32
42	61
43	108
44	149
45	89
46	2
47	4
48	8
49	16
50	32
51	63
52	120
53	208
54	274
55	144
56	2
57	4
58	8
59	16
60	32
61	64
62	125
63	236
64	401
65	504
66	233
67	2
68	4
69	8
70	16
71	32
72	64
73	127
74	248
75	464
76	773
77	927
78	377
79	2
80	4
81	8
82	16
83	32
84	64
85	128
86	253

n	a(n)
1	2
2	2
3	3
4	2
5	4
6	5
7	2
8	4
9	7
10	8
11	2
12	4
13	8
14	13
15	13
16	2
17	4
18	8
19	15
20	24
21	21
22	2
23	4
24	8
25	16
26	29
27	44
28	34
29	2
30	4
31	8
32	16
33	31
34	56
35	81
36	55
37	2
38	4
39	8
40	16
41	32
42	61
43	108
44	149
45	89
46	2
47	4
48	8
49	16
50	32
51	63
52	120
53	208
54	274
55	144
56	2
57	4
58	8
59	16
60	32
61	64
62	125
63	236
64	401
65	504
66	233
67	2
68	4
69	8
70	16
71	32
72	64
73	127
74	248
75	464
76	773
77	927
78	377
79	2
80	4
81	8
82	16
83	32
84	64
85	128
86	253

n	a(n)
1	2
2	2
3	3
4	2
5	4
6	5
7	2
8	4
9	7
10	8
11	2
12	4
13	8
14	13
15	13
16	2
17	4
18	8
19	15
20	24
21	21
22	2
23	4
24	8
25	16
26	29
27	44
28	34
29	2
30	4
31	8
32	16
33	31
34	56
35	81
36	55
37	2
38	4
39	8
40	16
41	32
42	61
43	108
44	149
45	89
46	2
47	4
48	8
49	16
50	32
51	63
52	120
53	208
54	274
55	144
56	2
57	4
58	8
59	16
60	32
61	64
62	125
63	236
64	401
65	504
66	233
67	2
68	4
69	8
70	16
71	32
72	64
73	127
74	248
75	464
76	773
77	927
78	377
79	2
80	4
81	8
82	16
83	32
84	64
85	128
86	253