A282147 - cp's OEIS frontend

A282147 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 = 6.

n	a(n)
1	7
2	14
3	21
4	28
5	35
6	38
7	42
8	45
9	52
10	59
11	73
12	76
13	83
14	84
15	115
16	126
17	146
18	157
19	168
20	188
21	199
22	210
23	217
24	219
25	226
26	228
27	233
28	252
29	257
30	259
31	270
32	290
33	301
34	312
35	332
36	343
37	354
38	363
39	374
40	385
41	405
42	416
43	427
44	434
45	438
46	445
47	456
48	476
49	487
50	498
51	504
52	507
53	518
54	529
55	549
56	560

[7, 14, 21, 28, 35, 38, 42, 45, 52, 59, 73, 76, 83, 84, 115, 126, 146, 157, 168, 188, 199, 210, 217, 219, 226, 228, 233, 252, 257, 259, 270, 290, 301, 312, 332, 343, 354, 363, 374, 385, 405, 416, 427, 434, 438, 445, 456, 476, 487, 498, 504, 507, 518, 529, 549, 560]

cp's OEIS Frontend

A282147 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 = 6.

Table of values

List of values

n	a(n)
1	7
2	14
3	21
4	28
5	35
6	38
7	42
8	45
9	52
10	59
11	73
12	76
13	83
14	84
15	115
16	126
17	146
18	157
19	168
20	188
21	199
22	210
23	217
24	219
25	226
26	228
27	233
28	252
29	257
30	259
31	270
32	290
33	301
34	312
35	332
36	343
37	354
38	363
39	374
40	385
41	405
42	416
43	427
44	434
45	438
46	445
47	456
48	476
49	487
50	498
51	504
52	507
53	518
54	529
55	549
56	560

n	a(n)
1	7
2	14
3	21
4	28
5	35
6	38
7	42
8	45
9	52
10	59
11	73
12	76
13	83
14	84
15	115
16	126
17	146
18	157
19	168
20	188
21	199
22	210
23	217
24	219
25	226
26	228
27	233
28	252
29	257
30	259
31	270
32	290
33	301
34	312
35	332
36	343
37	354
38	363
39	374
40	385
41	405
42	416
43	427
44	434
45	438
46	445
47	456
48	476
49	487
50	498
51	504
52	507
53	518
54	529
55	549
56	560

cp's OEIS Frontend

A282147 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 = 6.

Table of values

List of values

A282147 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 = 6.

n	a(n)
1	7
2	14
3	21
4	28
5	35
6	38
7	42
8	45
9	52
10	59
11	73
12	76
13	83
14	84
15	115
16	126
17	146
18	157
19	168
20	188
21	199
22	210
23	217
24	219
25	226
26	228
27	233
28	252
29	257
30	259
31	270
32	290
33	301
34	312
35	332
36	343
37	354
38	363
39	374
40	385
41	405
42	416
43	427
44	434
45	438
46	445
47	456
48	476
49	487
50	498
51	504
52	507
53	518
54	529
55	549
56	560