A282144 - cp's OEIS frontend

A282144 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 = 3.

n	a(n)
1	4
2	8
3	11
4	12
5	19
6	24
7	28
8	33
9	36
10	40
11	47
12	52
13	56
14	57
15	61
16	68
17	72
18	80
19	84
20	85
21	92
22	97
23	99
24	104
25	108
26	109
27	113
28	120
29	125
30	141
31	145
32	156
33	168
34	170
35	171
36	172
37	183
38	193
39	204
40	208
41	216
42	218
43	229
44	240
45	244
46	245
47	250
48	252
49	255
50	257
51	269
52	276
53	278
54	280
55	291
56	297
57	301
58	312

[4, 8, 11, 12, 19, 24, 28, 33, 36, 40, 47, 52, 56, 57, 61, 68, 72, 80, 84, 85, 92, 97, 99, 104, 108, 109, 113, 120, 125, 141, 145, 156, 168, 170, 171, 172, 183, 193, 204, 208, 216, 218, 229, 240, 244, 245, 250, 252, 255, 257, 269, 276, 278, 280, 291, 297, 301, 312]

cp's OEIS Frontend

A282144 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 = 3.

Table of values

List of values

n	a(n)
1	4
2	8
3	11
4	12
5	19
6	24
7	28
8	33
9	36
10	40
11	47
12	52
13	56
14	57
15	61
16	68
17	72
18	80
19	84
20	85
21	92
22	97
23	99
24	104
25	108
26	109
27	113
28	120
29	125
30	141
31	145
32	156
33	168
34	170
35	171
36	172
37	183
38	193
39	204
40	208
41	216
42	218
43	229
44	240
45	244
46	245
47	250
48	252
49	255
50	257
51	269
52	276
53	278
54	280
55	291
56	297
57	301
58	312

n	a(n)
1	4
2	8
3	11
4	12
5	19
6	24
7	28
8	33
9	36
10	40
11	47
12	52
13	56
14	57
15	61
16	68
17	72
18	80
19	84
20	85
21	92
22	97
23	99
24	104
25	108
26	109
27	113
28	120
29	125
30	141
31	145
32	156
33	168
34	170
35	171
36	172
37	183
38	193
39	204
40	208
41	216
42	218
43	229
44	240
45	244
46	245
47	250
48	252
49	255
50	257
51	269
52	276
53	278
54	280
55	291
56	297
57	301
58	312

cp's OEIS Frontend

A282144 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 = 3.

Table of values

List of values

A282144 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 = 3.

n	a(n)
1	4
2	8
3	11
4	12
5	19
6	24
7	28
8	33
9	36
10	40
11	47
12	52
13	56
14	57
15	61
16	68
17	72
18	80
19	84
20	85
21	92
22	97
23	99
24	104
25	108
26	109
27	113
28	120
29	125
30	141
31	145
32	156
33	168
34	170
35	171
36	172
37	183
38	193
39	204
40	208
41	216
42	218
43	229
44	240
45	244
46	245
47	250
48	252
49	255
50	257
51	269
52	276
53	278
54	280
55	291
56	297
57	301
58	312