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.

A282145 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 = 4.

Table of values

n a(n)
1 5
2 10
3 15
4 18
5 20
6 23
7 33
8 40
9 53
10 60
11 65
12 67
13 72
14 80
15 85
16 92
17 98
18 105
19 118
20 125
21 130
22 132
23 137
24 150
25 157
26 160
27 163
28 170
29 183
30 190
31 193
32 195
33 202
34 212
35 215
36 222
37 235
38 240
39 255
40 260
41 261
42 268
43 274
44 281
45 288
46 294
47 301
48 307
49 314
50 320
51 321
52 326
53 333
54 339
55 340
56 346

List of values

[5, 10, 15, 18, 20, 23, 33, 40, 53, 60, 65, 67, 72, 80, 85, 92, 98, 105, 118, 125, 130, 132, 137, 150, 157, 160, 163, 170, 183, 190, 193, 195, 202, 212, 215, 222, 235, 240, 255, 260, 261, 268, 274, 281, 288, 294, 301, 307, 314, 320, 321, 326, 333, 339, 340, 346]