A282115 - cp's OEIS frontend

A282115 Numbers m with k digits in base b (MSD(m)=d_k, LSD(m)=d_1) such that, for one of their digits in position d_k < j < d_1, Sum_{i=j+1..k} (i-j)d_i = Sum_{i=1..j-1} (j-i)d_i. Case b = 10.

n	a(n)
1	101
2	111
3	121
4	131
5	141
6	151
7	161
8	171
9	181
10	191
11	202
12	212
13	222
14	232
15	242
16	252
17	262
18	272
19	282
20	292
21	303
22	313
23	323
24	333
25	343
26	353
27	363
28	373
29	383
30	393
31	404
32	414
33	424
34	434
35	444
36	454
37	464
38	474
39	484
40	494
41	505
42	515
43	525
44	535
45	545
46	555
47	565
48	575
49	585
50	595
51	606
52	616
53	626

[101, 111, 121, 131, 141, 151, 161, 171, 181, 191, 202, 212, 222, 232, 242, 252, 262, 272, 282, 292, 303, 313, 323, 333, 343, 353, 363, 373, 383, 393, 404, 414, 424, 434, 444, 454, 464, 474, 484, 494, 505, 515, 525, 535, 545, 555, 565, 575, 585, 595, 606, 616, 626]

cp's OEIS Frontend

A282115 Numbers m with k digits in base b (MSD(m)=d_k, LSD(m)=d_1) such that, for one of their digits in position d_k < j < d_1, Sum_{i=j+1..k} (i-j)d_i = Sum_{i=1..j-1} (j-i)d_i. Case b = 10.

Table of values

List of values

n	a(n)
1	101
2	111
3	121
4	131
5	141
6	151
7	161
8	171
9	181
10	191
11	202
12	212
13	222
14	232
15	242
16	252
17	262
18	272
19	282
20	292
21	303
22	313
23	323
24	333
25	343
26	353
27	363
28	373
29	383
30	393
31	404
32	414
33	424
34	434
35	444
36	454
37	464
38	474
39	484
40	494
41	505
42	515
43	525
44	535
45	545
46	555
47	565
48	575
49	585
50	595
51	606
52	616
53	626

n	a(n)
1	101
2	111
3	121
4	131
5	141
6	151
7	161
8	171
9	181
10	191
11	202
12	212
13	222
14	232
15	242
16	252
17	262
18	272
19	282
20	292
21	303
22	313
23	323
24	333
25	343
26	353
27	363
28	373
29	383
30	393
31	404
32	414
33	424
34	434
35	444
36	454
37	464
38	474
39	484
40	494
41	505
42	515
43	525
44	535
45	545
46	555
47	565
48	575
49	585
50	595
51	606
52	616
53	626

cp's OEIS Frontend

A282115 Numbers m with k digits in base b (MSD(m)=d_k, LSD(m)=d_1) such that, for one of their digits in position d_k < j < d_1, Sum_{i=j+1..k} (i-j)*d_i = Sum_{i=1..j-1} (j-i)*d_i. Case b = 10.

Table of values

List of values

A282115 Numbers m with k digits in base b (MSD(m)=d_k, LSD(m)=d_1) such that, for one of their digits in position d_k < j < d_1, Sum_{i=j+1..k} (i-j)d_i = Sum_{i=1..j-1} (j-i)d_i. Case b = 10.

n	a(n)
1	101
2	111
3	121
4	131
5	141
6	151
7	161
8	171
9	181
10	191
11	202
12	212
13	222
14	232
15	242
16	252
17	262
18	272
19	282
20	292
21	303
22	313
23	323
24	333
25	343
26	353
27	363
28	373
29	383
30	393
31	404
32	414
33	424
34	434
35	444
36	454
37	464
38	474
39	484
40	494
41	505
42	515
43	525
44	535
45	545
46	555
47	565
48	575
49	585
50	595
51	606
52	616
53	626