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.

A277588 Numbers k such that k/10^m == 1 mod 10, where 10^m is the greatest power of 10 that divides n.

Table of values

n a(n)
1 1
2 10
3 11
4 21
5 31
6 41
7 51
8 61
9 71
10 81
11 91
12 100
13 101
14 110
15 111
16 121
17 131
18 141
19 151
20 161
21 171
22 181
23 191
24 201
25 210
26 211
27 221
28 231
29 241
30 251
31 261
32 271
33 281
34 291
35 301
36 310
37 311
38 321
39 331
40 341
41 351
42 361
43 371
44 381
45 391
46 401
47 410
48 411
49 421
50 431
51 441
52 451
53 461
54 471

List of values

[1, 10, 11, 21, 31, 41, 51, 61, 71, 81, 91, 100, 101, 110, 111, 121, 131, 141, 151, 161, 171, 181, 191, 201, 210, 211, 221, 231, 241, 251, 261, 271, 281, 291, 301, 310, 311, 321, 331, 341, 351, 361, 371, 381, 391, 401, 410, 411, 421, 431, 441, 451, 461, 471]