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.

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

Table of values

n a(n)
1 3
2 13
3 23
4 30
5 33
6 43
7 53
8 63
9 73
10 83
11 93
12 103
13 113
14 123
15 130
16 133
17 143
18 153
19 163
20 173
21 183
22 193
23 203
24 213
25 223
26 230
27 233
28 243
29 253
30 263
31 273
32 283
33 293
34 300
35 303
36 313
37 323
38 330
39 333
40 343
41 353
42 363
43 373
44 383
45 393
46 403
47 413
48 423
49 430
50 433
51 443
52 453
53 463
54 473

List of values

[3, 13, 23, 30, 33, 43, 53, 63, 73, 83, 93, 103, 113, 123, 130, 133, 143, 153, 163, 173, 183, 193, 203, 213, 223, 230, 233, 243, 253, 263, 273, 283, 293, 300, 303, 313, 323, 330, 333, 343, 353, 363, 373, 383, 393, 403, 413, 423, 430, 433, 443, 453, 463, 473]