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.

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

Table of values

n a(n)
1 6
2 16
3 26
4 36
5 46
6 56
7 60
8 66
9 76
10 86
11 96
12 106
13 116
14 126
15 136
16 146
17 156
18 160
19 166
20 176
21 186
22 196
23 206
24 216
25 226
26 236
27 246
28 256
29 260
30 266
31 276
32 286
33 296
34 306
35 316
36 326
37 336
38 346
39 356
40 360
41 366
42 376
43 386
44 396
45 406
46 416
47 426
48 436
49 446
50 456
51 460
52 466
53 476
54 486

List of values

[6, 16, 26, 36, 46, 56, 60, 66, 76, 86, 96, 106, 116, 126, 136, 146, 156, 160, 166, 176, 186, 196, 206, 216, 226, 236, 246, 256, 260, 266, 276, 286, 296, 306, 316, 326, 336, 346, 356, 360, 366, 376, 386, 396, 406, 416, 426, 436, 446, 456, 460, 466, 476, 486]