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.

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

Table of values

n a(n)
0 2
1 7
2 3
3 11
4 41
5 3
6 61
7 7
8 3
9 11
10 113
11 3
12 53
13 7
14 3
15 11
16 29
17 3
18 17
19 7
20 3
21 11
22 11111111111111111111111
23 3
24 41
25 7
26 3
27 11
28 53
29 3
30 661
31 7
32 3
33 11
34 17
35 3
36 2028119
37 7
38 3
39 11
40 83
41 3
42 173
43 7
44 3
45 11
46 40697
47 3
48 239
49 7
50 3
51 11
52 107
53 3
54 41
55 7
56 3
57 11
58 2836549
59 3
60 733
61 7
62 3
63 11

List of values

[2, 7, 3, 11, 41, 3, 61, 7, 3, 11, 113, 3, 53, 7, 3, 11, 29, 3, 17, 7, 3, 11, 11111111111111111111111, 3, 41, 7, 3, 11, 53, 3, 661, 7, 3, 11, 17, 3, 2028119, 7, 3, 11, 83, 3, 173, 7, 3, 11, 40697, 3, 239, 7, 3, 11, 107, 3, 41, 7, 3, 11, 2836549, 3, 733, 7, 3, 11]