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.

A350536 a(n) is the smallest proper multiple of 2n+1 which contains only odd digits, or -1 if no such multiple exists.

Table of values

n a(n)
0 3
1 9
2 15
3 35
4 99
5 33
6 39
7 75
8 51
9 57
10 315
11 115
12 75
13 135
14 319
15 93
16 99
17 175
18 111
19 117
20 533
21 559
22 135
23 517
24 539
25 153
26 159
27 715
28 171
29 177
30 793
31 315
32 195
33 335
34 759
35 355
36 511
37 375
38 539
39 395
40 1377
41 913
42 595
43 957
44 979
45 1911
46 1395
47 1995
48 3395
49 9999
50 1111
51 515
52 315
53 535
54 1199
55 333

List of values

[3, 9, 15, 35, 99, 33, 39, 75, 51, 57, 315, 115, 75, 135, 319, 93, 99, 175, 111, 117, 533, 559, 135, 517, 539, 153, 159, 715, 171, 177, 793, 315, 195, 335, 759, 355, 511, 375, 539, 395, 1377, 913, 595, 957, 979, 1911, 1395, 1995, 3395, 9999, 1111, 515, 315, 535, 1199, 333]