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.

A277595 Numbers k such that k/10^m == 8 mod 10, where 10^m is the greatest power of 10 that divides k.

Table of values

n a(n)
1 8
2 18
3 28
4 38
5 48
6 58
7 68
8 78
9 80
10 88
11 98
12 108
13 118
14 128
15 138
16 148
17 158
18 168
19 178
20 180
21 188
22 198
23 208
24 218
25 228
26 238
27 248
28 258
29 268
30 278
31 280
32 288
33 298
34 308
35 318
36 328
37 338
38 348
39 358
40 368
41 378
42 380
43 388
44 398
45 408
46 418
47 428
48 438
49 448
50 458
51 468
52 478
53 480
54 488

List of values

[8, 18, 28, 38, 48, 58, 68, 78, 80, 88, 98, 108, 118, 128, 138, 148, 158, 168, 178, 180, 188, 198, 208, 218, 228, 238, 248, 258, 268, 278, 280, 288, 298, 308, 318, 328, 338, 348, 358, 368, 378, 380, 388, 398, 408, 418, 428, 438, 448, 458, 468, 478, 480, 488]