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.

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

Table of values

n a(n)
1 2
2 12
3 20
4 22
5 32
6 42
7 52
8 62
9 72
10 82
11 92
12 102
13 112
14 120
15 122
16 132
17 142
18 152
19 162
20 172
21 182
22 192
23 200
24 202
25 212
26 220
27 222
28 232
29 242
30 252
31 262
32 272
33 282
34 292
35 302
36 312
37 320
38 322
39 332
40 342
41 352
42 362
43 372
44 382
45 392
46 402
47 412
48 420
49 422
50 432
51 442
52 452
53 462
54 472

List of values

[2, 12, 20, 22, 32, 42, 52, 62, 72, 82, 92, 102, 112, 120, 122, 132, 142, 152, 162, 172, 182, 192, 200, 202, 212, 220, 222, 232, 242, 252, 262, 272, 282, 292, 302, 312, 320, 322, 332, 342, 352, 362, 372, 382, 392, 402, 412, 420, 422, 432, 442, 452, 462, 472]