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.

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

Table of values

n a(n)
1 9
2 19
3 29
4 39
5 49
6 59
7 69
8 79
9 89
10 90
11 99
12 109
13 119
14 129
15 139
16 149
17 159
18 169
19 179
20 189
21 190
22 199
23 209
24 219
25 229
26 239
27 249
28 259
29 269
30 279
31 289
32 290
33 299
34 309
35 319
36 329
37 339
38 349
39 359
40 369
41 379
42 389
43 390
44 399
45 409
46 419
47 429
48 439
49 449
50 459
51 469
52 479
53 489
54 490

List of values

[9, 19, 29, 39, 49, 59, 69, 79, 89, 90, 99, 109, 119, 129, 139, 149, 159, 169, 179, 189, 190, 199, 209, 219, 229, 239, 249, 259, 269, 279, 289, 290, 299, 309, 319, 329, 339, 349, 359, 369, 379, 389, 390, 399, 409, 419, 429, 439, 449, 459, 469, 479, 489, 490]