A341841 - cp's OEIS frontend

A341841 Square array T(n, k), n, k >= 0, read by antidiagonals upwards; for any number m with runs in binary expansion (r_1, ..., r_j), let R(m) = {r_1 + ... + r_j, r_2 + ... + r_j, ..., r_j}; T(n, k) is the unique number t such that R(t) equals R(n) minus R(k).

n	a(n)
0	0
1	1
2	0
3	2
4	0
5	0
6	3
7	3
8	0
9	0
10	4
11	3
12	0
13	1
14	0
15	5
16	4
17	0
18	1
19	1
20	0
21	6
22	4
23	7
24	0
25	1
26	0
27	0
28	7
29	7
30	7
31	7
32	0
33	0
34	0
35	0
36	8
37	7
38	7
39	6
40	0
41	0
42	3
43	1
44	0
45	9
46	8
47	7
48	6
49	1
50	0
51	3
52	2
53	1
54	0
55	10
56	8
57	8
58	7
59	1
60	0
61	3
62	3
63	2
64	0
65	0
66	11
67	11
68	8
69	8
70	0
71	0
72	3
73	3
74	3
75	3
76	0
77	0
78	12
79	11
80	8
81	9
82	15
83	0
84	0
85	2
86	3
87	3
88	0
89	1
90	0

[0, 1, 0, 2, 0, 0, 3, 3, 0, 0, 4, 3, 0, 1, 0, 5, 4, 0, 1, 1, 0, 6, 4, 7, 0, 1, 0, 0, 7, 7, 7, 7, 0, 0, 0, 0, 8, 7, 7, 6, 0, 0, 3, 1, 0, 9, 8, 7, 6, 1, 0, 3, 2, 1, 0, 10, 8, 8, 7, 1, 0, 3, 3, 2, 0, 0, 11, 11, 8, 8, 0, 0, 3, 3, 3, 3, 0, 0, 12, 11, 8, 9, 15, 0, 0, 2, 3, 3, 0, 1, 0]

cp's OEIS Frontend

A341841 Square array T(n, k), n, k >= 0, read by antidiagonals upwards; for any number m with runs in binary expansion (r_1, ..., r_j), let R(m) = {r_1 + ... + r_j, r_2 + ... + r_j, ..., r_j}; T(n, k) is the unique number t such that R(t) equals R(n) minus R(k).

Table of values

List of values

n	a(n)
0	0
1	1
2	0
3	2
4	0
5	0
6	3
7	3
8	0
9	0
10	4
11	3
12	0
13	1
14	0
15	5
16	4
17	0
18	1
19	1
20	0
21	6
22	4
23	7
24	0
25	1
26	0
27	0
28	7
29	7
30	7
31	7
32	0
33	0
34	0
35	0
36	8
37	7
38	7
39	6
40	0
41	0
42	3
43	1
44	0
45	9
46	8
47	7
48	6
49	1
50	0
51	3
52	2
53	1
54	0
55	10
56	8
57	8
58	7
59	1
60	0
61	3
62	3
63	2
64	0
65	0
66	11
67	11
68	8
69	8
70	0
71	0
72	3
73	3
74	3
75	3
76	0
77	0
78	12
79	11
80	8
81	9
82	15
83	0
84	0
85	2
86	3
87	3
88	0
89	1
90	0

n	a(n)
0	0
1	1
2	0
3	2
4	0
5	0
6	3
7	3
8	0
9	0
10	4
11	3
12	0
13	1
14	0
15	5
16	4
17	0
18	1
19	1
20	0
21	6
22	4
23	7
24	0
25	1
26	0
27	0
28	7
29	7
30	7
31	7
32	0
33	0
34	0
35	0
36	8
37	7
38	7
39	6
40	0
41	0
42	3
43	1
44	0
45	9
46	8
47	7
48	6
49	1
50	0
51	3
52	2
53	1
54	0
55	10
56	8
57	8
58	7
59	1
60	0
61	3
62	3
63	2
64	0
65	0
66	11
67	11
68	8
69	8
70	0
71	0
72	3
73	3
74	3
75	3
76	0
77	0
78	12
79	11
80	8
81	9
82	15
83	0
84	0
85	2
86	3
87	3
88	0
89	1
90	0

n	a(n)
0	0
1	1
2	0
3	2
4	0
5	0
6	3
7	3
8	0
9	0
10	4
11	3
12	0
13	1
14	0
15	5
16	4
17	0
18	1
19	1
20	0
21	6
22	4
23	7
24	0
25	1
26	0
27	0
28	7
29	7
30	7
31	7
32	0
33	0
34	0
35	0
36	8
37	7
38	7
39	6
40	0
41	0
42	3
43	1
44	0
45	9
46	8
47	7
48	6
49	1
50	0
51	3
52	2
53	1
54	0
55	10
56	8
57	8
58	7
59	1
60	0
61	3
62	3
63	2
64	0
65	0
66	11
67	11
68	8
69	8
70	0
71	0
72	3
73	3
74	3
75	3
76	0
77	0
78	12
79	11
80	8
81	9
82	15
83	0
84	0
85	2
86	3
87	3
88	0
89	1
90	0