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.

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

Table of values

n a(n)
1 37
2 43
3 49
4 55
5 61
6 67
7 74
8 80
9 86
10 92
11 98
12 104
13 111
14 117
15 123
16 129
17 135
18 141
19 148
20 154
21 160
22 166
23 172
24 178
25 185
26 191
27 197
28 203
29 209
30 215
31 218
32 222
33 224
34 230
35 236
36 242
37 248
38 255
39 258
40 261
41 267
42 273
43 279
44 285
45 292
46 294
47 298
48 304
49 310
50 316
51 322
52 329
53 330
54 335
55 341

List of values

[37, 43, 49, 55, 61, 67, 74, 80, 86, 92, 98, 104, 111, 117, 123, 129, 135, 141, 148, 154, 160, 166, 172, 178, 185, 191, 197, 203, 209, 215, 218, 222, 224, 230, 236, 242, 248, 255, 258, 261, 267, 273, 279, 285, 292, 294, 298, 304, 310, 316, 322, 329, 330, 335, 341]