A351786 - cp's OEIS frontend

A351786 Symmetric array T(n, k), n, k >= 0, read by antidiagonals; for any m >= 0 with binary expansion Sum_{i >= 0} b_i2^i, let d(m) = Sum_{i >= 0} b_i 2^A130472(i); let t be the inverse of d; T(n, k) = t(d(n) * d(k)).

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

[0, 0, 0, 0, 1, 0, 0, 2, 2, 0, 0, 3, 8, 3, 0, 0, 4, 10, 10, 4, 0, 0, 5, 1, 12, 1, 5, 0, 0, 6, 3, 5, 5, 3, 6, 0, 0, 7, 9, 18, 16, 18, 9, 7, 0, 0, 8, 11, 15, 20, 20, 15, 11, 8, 0, 0, 9, 32, 25, 17, 65, 17, 25, 32, 9, 0, 0, 10, 34, 40, 21, 23, 23, 21, 40, 34, 10, 0]

cp's OEIS Frontend

A351786 Symmetric array T(n, k), n, k >= 0, read by antidiagonals; for any m >= 0 with binary expansion Sum_{i >= 0} b_i2^i, let d(m) = Sum_{i >= 0} b_i 2^A130472(i); let t be the inverse of d; T(n, k) = t(d(n) * d(k)).

Table of values

List of values

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

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

cp's OEIS Frontend

A351786 Symmetric array T(n, k), n, k >= 0, read by antidiagonals; for any m >= 0 with binary expansion Sum_{i >= 0} b_i*2^i, let d(m) = Sum_{i >= 0} b_i * 2^A130472(i); let t be the inverse of d; T(n, k) = t(d(n) * d(k)).

Table of values

List of values

A351786 Symmetric array T(n, k), n, k >= 0, read by antidiagonals; for any m >= 0 with binary expansion Sum_{i >= 0} b_i2^i, let d(m) = Sum_{i >= 0} b_i 2^A130472(i); let t be the inverse of d; T(n, k) = t(d(n) * d(k)).

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