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.

A282108 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 = 3.

Table of values

n a(n)
1 10
2 13
3 16
4 20
5 23
6 26
7 29
8 30
9 32
10 35
11 39
12 48
13 55
14 60
15 64
16 69
17 73
18 78
19 82
20 87
21 90
22 91
23 96
24 100
25 105
26 112
27 117
28 121
29 130
30 137
31 142
32 144
33 146
34 151
35 155
36 160
37 164
38 165
39 169
40 173
41 178
42 180
43 182
44 187
45 192
46 194
47 203
48 207
49 212
50 219
51 224
52 233
53 234
54 242
55 246
56 247
57 256

List of values

[10, 13, 16, 20, 23, 26, 29, 30, 32, 35, 39, 48, 55, 60, 64, 69, 73, 78, 82, 87, 90, 91, 96, 100, 105, 112, 117, 121, 130, 137, 142, 144, 146, 151, 155, 160, 164, 165, 169, 173, 178, 180, 182, 187, 192, 194, 203, 207, 212, 219, 224, 233, 234, 242, 246, 247, 256]