A282149 - cp's OEIS frontend

A282149 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 = 8.

n	a(n)
1	9
2	18
3	27
4	36
5	45
6	54
7	63
8	66
9	72
10	75
11	84
12	93
13	102
14	111
15	129
16	132
17	141
18	144
19	150
20	159
21	198
22	201
23	207
24	216
25	258
26	273
27	288
28	330
29	345
30	360
31	387
32	402
33	417
34	432
35	459
36	474
37	489
38	504
39	513
40	515
41	524
42	528
43	533
44	542
45	551
46	576
47	581
48	585
49	590
50	599
51	600
52	642
53	647
54	657
55	672

[9, 18, 27, 36, 45, 54, 63, 66, 72, 75, 84, 93, 102, 111, 129, 132, 141, 144, 150, 159, 198, 201, 207, 216, 258, 273, 288, 330, 345, 360, 387, 402, 417, 432, 459, 474, 489, 504, 513, 515, 524, 528, 533, 542, 551, 576, 581, 585, 590, 599, 600, 642, 647, 657, 672]

cp's OEIS Frontend

A282149 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 = 8.

Table of values

List of values

n	a(n)
1	9
2	18
3	27
4	36
5	45
6	54
7	63
8	66
9	72
10	75
11	84
12	93
13	102
14	111
15	129
16	132
17	141
18	144
19	150
20	159
21	198
22	201
23	207
24	216
25	258
26	273
27	288
28	330
29	345
30	360
31	387
32	402
33	417
34	432
35	459
36	474
37	489
38	504
39	513
40	515
41	524
42	528
43	533
44	542
45	551
46	576
47	581
48	585
49	590
50	599
51	600
52	642
53	647
54	657
55	672

n	a(n)
1	9
2	18
3	27
4	36
5	45
6	54
7	63
8	66
9	72
10	75
11	84
12	93
13	102
14	111
15	129
16	132
17	141
18	144
19	150
20	159
21	198
22	201
23	207
24	216
25	258
26	273
27	288
28	330
29	345
30	360
31	387
32	402
33	417
34	432
35	459
36	474
37	489
38	504
39	513
40	515
41	524
42	528
43	533
44	542
45	551
46	576
47	581
48	585
49	590
50	599
51	600
52	642
53	647
54	657
55	672

cp's OEIS Frontend

A282149 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 = 8.

Table of values

List of values

A282149 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 = 8.

n	a(n)
1	9
2	18
3	27
4	36
5	45
6	54
7	63
8	66
9	72
10	75
11	84
12	93
13	102
14	111
15	129
16	132
17	141
18	144
19	150
20	159
21	198
22	201
23	207
24	216
25	258
26	273
27	288
28	330
29	345
30	360
31	387
32	402
33	417
34	432
35	459
36	474
37	489
38	504
39	513
40	515
41	524
42	528
43	533
44	542
45	551
46	576
47	581
48	585
49	590
50	599
51	600
52	642
53	647
54	657
55	672