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.

A366165 a(n) is the least k > 0 such that 10^(2*n-1) - k can be written as a product j*m, where j and m have an equal number of decimal digits.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 10
6 1
7 3
8 1
9 5
10 3
11 1
12 6
13 1
14 7
15 1
16 2
17 2
18 1
19 4
20 7
21 5
22 1
23 1
24 3
25 2
26 1
27 1
28 1
29 1
30 2
31 1
32 1
33 10
34 4
35 3
36 3
37 10
38 1
39 2
40 3
41 1
42 1
43 1
44 7
45 1
46 1

List of values

[1, 1, 1, 1, 10, 1, 3, 1, 5, 3, 1, 6, 1, 7, 1, 2, 2, 1, 4, 7, 5, 1, 1, 3, 2, 1, 1, 1, 1, 2, 1, 1, 10, 4, 3, 3, 10, 1, 2, 3, 1, 1, 1, 7, 1, 1]