A282148 - cp's OEIS frontend

A282148 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 = 7.

n	a(n)
1	8
2	16
3	24
4	32
5	40
6	48
7	51
8	56
9	59
10	67
11	75
12	83
13	99
14	102
15	110
16	112
17	118
18	153
19	155
20	168
21	198
22	211
23	224
24	254
25	267
26	280
27	297
28	310
29	323
30	336
31	344
32	346
33	354
34	357
35	362
36	370
37	392
38	397
39	400
40	405
41	413
42	443
43	456
44	469
45	499
46	512
47	525
48	542
49	555
50	568
51	581
52	598
53	611
54	624
55	641
56	654

[8, 16, 24, 32, 40, 48, 51, 56, 59, 67, 75, 83, 99, 102, 110, 112, 118, 153, 155, 168, 198, 211, 224, 254, 267, 280, 297, 310, 323, 336, 344, 346, 354, 357, 362, 370, 392, 397, 400, 405, 413, 443, 456, 469, 499, 512, 525, 542, 555, 568, 581, 598, 611, 624, 641, 654]

cp's OEIS Frontend

A282148 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 = 7.

Table of values

List of values

n	a(n)
1	8
2	16
3	24
4	32
5	40
6	48
7	51
8	56
9	59
10	67
11	75
12	83
13	99
14	102
15	110
16	112
17	118
18	153
19	155
20	168
21	198
22	211
23	224
24	254
25	267
26	280
27	297
28	310
29	323
30	336
31	344
32	346
33	354
34	357
35	362
36	370
37	392
38	397
39	400
40	405
41	413
42	443
43	456
44	469
45	499
46	512
47	525
48	542
49	555
50	568
51	581
52	598
53	611
54	624
55	641
56	654

n	a(n)
1	8
2	16
3	24
4	32
5	40
6	48
7	51
8	56
9	59
10	67
11	75
12	83
13	99
14	102
15	110
16	112
17	118
18	153
19	155
20	168
21	198
22	211
23	224
24	254
25	267
26	280
27	297
28	310
29	323
30	336
31	344
32	346
33	354
34	357
35	362
36	370
37	392
38	397
39	400
40	405
41	413
42	443
43	456
44	469
45	499
46	512
47	525
48	542
49	555
50	568
51	581
52	598
53	611
54	624
55	641
56	654

cp's OEIS Frontend

A282148 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 = 7.

Table of values

List of values

A282148 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 = 7.

n	a(n)
1	8
2	16
3	24
4	32
5	40
6	48
7	51
8	56
9	59
10	67
11	75
12	83
13	99
14	102
15	110
16	112
17	118
18	153
19	155
20	168
21	198
22	211
23	224
24	254
25	267
26	280
27	297
28	310
29	323
30	336
31	344
32	346
33	354
34	357
35	362
36	370
37	392
38	397
39	400
40	405
41	413
42	443
43	456
44	469
45	499
46	512
47	525
48	542
49	555
50	568
51	581
52	598
53	611
54	624
55	641
56	654