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.

A089776 If n mod 10 is 1, 3, 7, or 9, then a(n) = least prime of the form 1 followed by n^r; else a(n) = least prime of the form n^r followed by a 1. In both cases r must be > 1 and a(n) = 0 if no such prime exists.

Table of values

n a(n)
1 11
2 41
3 13
4 41
5 251
6 61
7 17
8 641
9 19
10 101
11 114641
12 0
13 113
14 75295361
15 151
16 40961
17 1289
18 181
19 1361
20 4001
21 11025506433613486607375777617584133309366191904729927960524981845743709132117581
22 1368800680154120519681
23 1907846434775996175406740561329
24 241
25 251
26 6761
27 127
28 281
29 1500246412961
30 9001
31 131

List of values

[11, 41, 13, 41, 251, 61, 17, 641, 19, 101, 114641, 0, 113, 75295361, 151, 40961, 1289, 181, 1361, 4001, 11025506433613486607375777617584133309366191904729927960524981845743709132117581, 1368800680154120519681, 1907846434775996175406740561329, 241, 251, 6761, 127, 281, 1500246412961, 9001, 131]