A282146 - cp's OEIS frontend

A282146 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 = 5.

n	a(n)
1	6
2	12
3	18
4	24
5	27
6	30
7	33
8	39
9	51
10	54
11	60
12	81
13	90
14	102
15	111
16	120
17	126
18	128
19	134
20	135
21	150
22	156
23	165
24	177
25	186
26	195
27	207
28	216
29	228
30	237
31	246
32	252
33	255
34	261
35	270
36	282
37	291
38	300
39	303
40	312
41	321
42	333
43	342
44	354
45	363
46	372
47	376
48	378
49	387
50	396
51	405
52	408
53	417
54	429
55	438
56	447

[6, 12, 18, 24, 27, 30, 33, 39, 51, 54, 60, 81, 90, 102, 111, 120, 126, 128, 134, 135, 150, 156, 165, 177, 186, 195, 207, 216, 228, 237, 246, 252, 255, 261, 270, 282, 291, 300, 303, 312, 321, 333, 342, 354, 363, 372, 376, 378, 387, 396, 405, 408, 417, 429, 438, 447]

cp's OEIS Frontend

A282146 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 = 5.

Table of values

List of values

n	a(n)
1	6
2	12
3	18
4	24
5	27
6	30
7	33
8	39
9	51
10	54
11	60
12	81
13	90
14	102
15	111
16	120
17	126
18	128
19	134
20	135
21	150
22	156
23	165
24	177
25	186
26	195
27	207
28	216
29	228
30	237
31	246
32	252
33	255
34	261
35	270
36	282
37	291
38	300
39	303
40	312
41	321
42	333
43	342
44	354
45	363
46	372
47	376
48	378
49	387
50	396
51	405
52	408
53	417
54	429
55	438
56	447

n	a(n)
1	6
2	12
3	18
4	24
5	27
6	30
7	33
8	39
9	51
10	54
11	60
12	81
13	90
14	102
15	111
16	120
17	126
18	128
19	134
20	135
21	150
22	156
23	165
24	177
25	186
26	195
27	207
28	216
29	228
30	237
31	246
32	252
33	255
34	261
35	270
36	282
37	291
38	300
39	303
40	312
41	321
42	333
43	342
44	354
45	363
46	372
47	376
48	378
49	387
50	396
51	405
52	408
53	417
54	429
55	438
56	447

cp's OEIS Frontend

A282146 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 = 5.

Table of values

List of values

A282146 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 = 5.

n	a(n)
1	6
2	12
3	18
4	24
5	27
6	30
7	33
8	39
9	51
10	54
11	60
12	81
13	90
14	102
15	111
16	120
17	126
18	128
19	134
20	135
21	150
22	156
23	165
24	177
25	186
26	195
27	207
28	216
29	228
30	237
31	246
32	252
33	255
34	261
35	270
36	282
37	291
38	300
39	303
40	312
41	321
42	333
43	342
44	354
45	363
46	372
47	376
48	378
49	387
50	396
51	405
52	408
53	417
54	429
55	438
56	447