cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A282112 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+1..k}{(i-j)*d_i} = Sum_{i=1..j-1}{(j-i)*d_i}. Case x = 7.

Table of values

n a(n)
1 50
2 57
3 64
4 71
5 78
6 85
7 92
8 100
9 107
10 114
11 121
12 128
13 135
14 142
15 150
16 157
17 164
18 171
19 178
20 185
21 192
22 200
23 207
24 214
25 221
26 228
27 235
28 242
29 250
30 257
31 264
32 271
33 278
34 285
35 292
36 300
37 307
38 314
39 321
40 328
41 335
42 342
43 345
44 350
45 352
46 359
47 366
48 373
49 380
50 387
51 395
52 399
53 402
54 409

List of values

[50, 57, 64, 71, 78, 85, 92, 100, 107, 114, 121, 128, 135, 142, 150, 157, 164, 171, 178, 185, 192, 200, 207, 214, 221, 228, 235, 242, 250, 257, 264, 271, 278, 285, 292, 300, 307, 314, 321, 328, 335, 342, 345, 350, 352, 359, 366, 373, 380, 387, 395, 399, 402, 409]