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.

A220947 Least prime p such that sum_{k=0}^n F(k+1)*x^{n-k} is irreducible modulo p, where F(j) denotes the Fibonacci number A000045(j).

Table of values

n a(n)
1 2
2 3
3 2
4 11
5 3
6 2
7 5
8 3
9 2
10 11
11 5
12 41
13 181
14 31
15 73
16 89
17 5
18 7
19 71
20 11
21 29
22 5
23 193
24 41
25 89
26 61
27 2
28 43
29 3
30 31
31 13
32 191
33 2
34 61
35 103
36 97
37 103
38 47
39 383
40 367
41 89
42 17
43 191
44 1627
45 193
46 163
47 5
48 337
49 349
50 23
51 149
52 193
53 199
54 233
55 173
56 617
57 593
58 59
59 113
60 151

List of values

[2, 3, 2, 11, 3, 2, 5, 3, 2, 11, 5, 41, 181, 31, 73, 89, 5, 7, 71, 11, 29, 5, 193, 41, 89, 61, 2, 43, 3, 31, 13, 191, 2, 61, 103, 97, 103, 47, 383, 367, 89, 17, 191, 1627, 193, 163, 5, 337, 349, 23, 149, 193, 199, 233, 173, 617, 593, 59, 113, 151]