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.

A359142 Let s = sum of digits of n, let t = decimal concatenation of n and s, let u be obtained by deleting all copies of the leading digit of t from t, if this digit occurs in s. Then if u has only zero digits, a(n) = 0; if u has leading digit 0 but not all its digits are 0, delete all leading 0's from u and negate the result to get a(n); otherwise a(n) = u.

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 0
6 0
7 0
8 0
9 0
10 0
11 112
12 123
13 134
14 145
15 156
16 167
17 178
18 189
19 90
20 0
21 213
22 224
23 235
24 246
25 257
26 268
27 279
28 2810
29 2911
30 0
31 314
32 325
33 336
34 347
35 358
36 369
37 3710
38 3811
39 3912
40 0
41 415
42 426
43 437
44 448
45 459
46 4610
47 4711
48 4812
49 4913
50 0
51 516
52 527
53 538
54 549
55 5510
56 5611
57 5712
58 5813

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 112, 123, 134, 145, 156, 167, 178, 189, 90, 0, 213, 224, 235, 246, 257, 268, 279, 2810, 2911, 0, 314, 325, 336, 347, 358, 369, 3710, 3811, 3912, 0, 415, 426, 437, 448, 459, 4610, 4711, 4812, 4913, 0, 516, 527, 538, 549, 5510, 5611, 5712, 5813]