A282143 - cp's OEIS frontend

A282143 Numbers n with k digits in base x (MSD(n)=d_k, LSD(n)=d_1) such that, chosen one of their digits in position d_k < j < d_1, is Sum_{i=j..k}{(i-j+1)d_i} = Sum_{i=1..j-1}{(j-i)d_i}. Case x = 2.

n	a(n)
1	3
2	6
3	9
4	12
5	15
6	18
7	19
8	24
9	25
10	30
11	33
12	36
13	38
14	45
15	48
16	50
17	51
18	60
19	63
20	66
21	69
22	72
23	75
24	76
25	81
26	87
27	90
28	96
29	100
30	102
31	105
32	117
33	120
34	126
35	129
36	131
37	132
38	138
39	143
40	144
41	150
42	152
43	153
44	162
45	165
46	174
47	179
48	180
49	189
50	192
51	193
52	195
53	200
54	204
55	205
56	210
57	219
58	231
59	234

[3, 6, 9, 12, 15, 18, 19, 24, 25, 30, 33, 36, 38, 45, 48, 50, 51, 60, 63, 66, 69, 72, 75, 76, 81, 87, 90, 96, 100, 102, 105, 117, 120, 126, 129, 131, 132, 138, 143, 144, 150, 152, 153, 162, 165, 174, 179, 180, 189, 192, 193, 195, 200, 204, 205, 210, 219, 231, 234]

cp's OEIS Frontend

A282143 Numbers n with k digits in base x (MSD(n)=d_k, LSD(n)=d_1) such that, chosen one of their digits in position d_k < j < d_1, is Sum_{i=j..k}{(i-j+1)d_i} = Sum_{i=1..j-1}{(j-i)d_i}. Case x = 2.

Table of values

List of values

n	a(n)
1	3
2	6
3	9
4	12
5	15
6	18
7	19
8	24
9	25
10	30
11	33
12	36
13	38
14	45
15	48
16	50
17	51
18	60
19	63
20	66
21	69
22	72
23	75
24	76
25	81
26	87
27	90
28	96
29	100
30	102
31	105
32	117
33	120
34	126
35	129
36	131
37	132
38	138
39	143
40	144
41	150
42	152
43	153
44	162
45	165
46	174
47	179
48	180
49	189
50	192
51	193
52	195
53	200
54	204
55	205
56	210
57	219
58	231
59	234

n	a(n)
1	3
2	6
3	9
4	12
5	15
6	18
7	19
8	24
9	25
10	30
11	33
12	36
13	38
14	45
15	48
16	50
17	51
18	60
19	63
20	66
21	69
22	72
23	75
24	76
25	81
26	87
27	90
28	96
29	100
30	102
31	105
32	117
33	120
34	126
35	129
36	131
37	132
38	138
39	143
40	144
41	150
42	152
43	153
44	162
45	165
46	174
47	179
48	180
49	189
50	192
51	193
52	195
53	200
54	204
55	205
56	210
57	219
58	231
59	234

cp's OEIS Frontend

A282143 Numbers n with k digits in base x (MSD(n)=d_k, LSD(n)=d_1) such that, chosen one of their digits in position d_k < j < d_1, is Sum_{i=j..k}{(i-j+1)*d_i} = Sum_{i=1..j-1}{(j-i)*d_i}. Case x = 2.

Table of values

List of values

A282143 Numbers n with k digits in base x (MSD(n)=d_k, LSD(n)=d_1) such that, chosen one of their digits in position d_k < j < d_1, is Sum_{i=j..k}{(i-j+1)d_i} = Sum_{i=1..j-1}{(j-i)d_i}. Case x = 2.

n	a(n)
1	3
2	6
3	9
4	12
5	15
6	18
7	19
8	24
9	25
10	30
11	33
12	36
13	38
14	45
15	48
16	50
17	51
18	60
19	63
20	66
21	69
22	72
23	75
24	76
25	81
26	87
27	90
28	96
29	100
30	102
31	105
32	117
33	120
34	126
35	129
36	131
37	132
38	138
39	143
40	144
41	150
42	152
43	153
44	162
45	165
46	174
47	179
48	180
49	189
50	192
51	193
52	195
53	200
54	204
55	205
56	210
57	219
58	231
59	234