A282151 - cp's OEIS frontend

A282151 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 = 10.

n	a(n)
1	11
2	22
3	33
4	44
5	55
6	66
7	77
8	88
9	99
10	102
11	110
12	113
13	124
14	135
15	146
16	157
17	168
18	179
19	201
20	204
21	215
22	220
23	226
24	237
25	248
26	259
27	306
28	311
29	317
30	328
31	330
32	339
33	402
34	408
35	419
36	421
37	440
38	512
39	531
40	550
41	603
42	622
43	641
44	660
45	713
46	732
47	751
48	770
49	804
50	823
51	842
52	861
53	880
54	914
55	933

[11, 22, 33, 44, 55, 66, 77, 88, 99, 102, 110, 113, 124, 135, 146, 157, 168, 179, 201, 204, 215, 220, 226, 237, 248, 259, 306, 311, 317, 328, 330, 339, 402, 408, 419, 421, 440, 512, 531, 550, 603, 622, 641, 660, 713, 732, 751, 770, 804, 823, 842, 861, 880, 914, 933]

cp's OEIS Frontend

A282151 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 = 10.

Table of values

List of values

n	a(n)
1	11
2	22
3	33
4	44
5	55
6	66
7	77
8	88
9	99
10	102
11	110
12	113
13	124
14	135
15	146
16	157
17	168
18	179
19	201
20	204
21	215
22	220
23	226
24	237
25	248
26	259
27	306
28	311
29	317
30	328
31	330
32	339
33	402
34	408
35	419
36	421
37	440
38	512
39	531
40	550
41	603
42	622
43	641
44	660
45	713
46	732
47	751
48	770
49	804
50	823
51	842
52	861
53	880
54	914
55	933

n	a(n)
1	11
2	22
3	33
4	44
5	55
6	66
7	77
8	88
9	99
10	102
11	110
12	113
13	124
14	135
15	146
16	157
17	168
18	179
19	201
20	204
21	215
22	220
23	226
24	237
25	248
26	259
27	306
28	311
29	317
30	328
31	330
32	339
33	402
34	408
35	419
36	421
37	440
38	512
39	531
40	550
41	603
42	622
43	641
44	660
45	713
46	732
47	751
48	770
49	804
50	823
51	842
52	861
53	880
54	914
55	933

cp's OEIS Frontend

A282151 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 = 10.

Table of values

List of values

A282151 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 = 10.

n	a(n)
1	11
2	22
3	33
4	44
5	55
6	66
7	77
8	88
9	99
10	102
11	110
12	113
13	124
14	135
15	146
16	157
17	168
18	179
19	201
20	204
21	215
22	220
23	226
24	237
25	248
26	259
27	306
28	311
29	317
30	328
31	330
32	339
33	402
34	408
35	419
36	421
37	440
38	512
39	531
40	550
41	603
42	622
43	641
44	660
45	713
46	732
47	751
48	770
49	804
50	823
51	842
52	861
53	880
54	914
55	933