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.

A365928 Smallest prime factor of f(n) = 10^(2*n) + (10^n - 1)/9.

Table of values

n a(n)
1 101
2 3
3 7
4 7
5 3
6 317
7 40637
8 3
9 7
10 7
11 3
12 1487
13 101
14 3
15 7
16 7
17 3
18 39855301
19 641
20 3
21 7
22 7
23 3
24 162340676822011484150719
25 101
26 3
27 7
28 7
29 3
30 121068683
31 47
32 3
33 7
34 7
35 3
36 107
37 71
38 3
39 7
40 7
41 3
42 67
43 695841737
44 3
45 7
46 7
47 3
48 47
49 101
50 3
51 7
52 7
53 3
54 8933
55 677
56 3
57 7
58 7
59 3
60 10305833206337

List of values

[101, 3, 7, 7, 3, 317, 40637, 3, 7, 7, 3, 1487, 101, 3, 7, 7, 3, 39855301, 641, 3, 7, 7, 3, 162340676822011484150719, 101, 3, 7, 7, 3, 121068683, 47, 3, 7, 7, 3, 107, 71, 3, 7, 7, 3, 67, 695841737, 3, 7, 7, 3, 47, 101, 3, 7, 7, 3, 8933, 677, 3, 7, 7, 3, 10305833206337]