A282150 - cp's OEIS frontend

A282150 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 = 9.

n	a(n)
1	10
2	20
3	30
4	40
5	50
6	60
7	70
8	80
9	83
10	90
11	93
12	103
13	113
14	123
15	133
16	143
17	163
18	166
19	176
20	180
21	186
22	196
23	206
24	249
25	253
26	259
27	269
28	270
29	326
30	332
31	343
32	360
33	416
34	433
35	450
36	489
37	506
38	523
39	540
40	579
41	596
42	613
43	630
44	652
45	669
46	686
47	703
48	720
49	730
50	732
51	742
52	747
53	752
54	762
55	772

[10, 20, 30, 40, 50, 60, 70, 80, 83, 90, 93, 103, 113, 123, 133, 143, 163, 166, 176, 180, 186, 196, 206, 249, 253, 259, 269, 270, 326, 332, 343, 360, 416, 433, 450, 489, 506, 523, 540, 579, 596, 613, 630, 652, 669, 686, 703, 720, 730, 732, 742, 747, 752, 762, 772]

cp's OEIS Frontend

A282150 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 = 9.

Table of values

List of values

n	a(n)
1	10
2	20
3	30
4	40
5	50
6	60
7	70
8	80
9	83
10	90
11	93
12	103
13	113
14	123
15	133
16	143
17	163
18	166
19	176
20	180
21	186
22	196
23	206
24	249
25	253
26	259
27	269
28	270
29	326
30	332
31	343
32	360
33	416
34	433
35	450
36	489
37	506
38	523
39	540
40	579
41	596
42	613
43	630
44	652
45	669
46	686
47	703
48	720
49	730
50	732
51	742
52	747
53	752
54	762
55	772

n	a(n)
1	10
2	20
3	30
4	40
5	50
6	60
7	70
8	80
9	83
10	90
11	93
12	103
13	113
14	123
15	133
16	143
17	163
18	166
19	176
20	180
21	186
22	196
23	206
24	249
25	253
26	259
27	269
28	270
29	326
30	332
31	343
32	360
33	416
34	433
35	450
36	489
37	506
38	523
39	540
40	579
41	596
42	613
43	630
44	652
45	669
46	686
47	703
48	720
49	730
50	732
51	742
52	747
53	752
54	762
55	772

cp's OEIS Frontend

A282150 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 = 9.

Table of values

List of values

A282150 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 = 9.

n	a(n)
1	10
2	20
3	30
4	40
5	50
6	60
7	70
8	80
9	83
10	90
11	93
12	103
13	113
14	123
15	133
16	143
17	163
18	166
19	176
20	180
21	186
22	196
23	206
24	249
25	253
26	259
27	269
28	270
29	326
30	332
31	343
32	360
33	416
34	433
35	450
36	489
37	506
38	523
39	540
40	579
41	596
42	613
43	630
44	652
45	669
46	686
47	703
48	720
49	730
50	732
51	742
52	747
53	752
54	762
55	772