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.

A246556 a(n) = smallest prime which divides Pell(n) = A000129(n) but does not divide any Pell(k) for k or -1 if no such prime exists.

Table of values

n a(n)
2 2
3 5
4 3
5 29
6 7
7 13
8 17
9 197
10 41
11 5741
12 11
13 33461
14 239
15 269
16 577
17 137
18 199
19 37
20 19
21 45697
22 23
23 229
24 1153
25 1549
26 79
27 53
28 113
29 44560482149
30 31
31 61
32 665857
33 52734529
34 103
35 1800193921
36 73
37 593
38 9369319
39 389
40 241
41 1746860020068409
42 4663
43 11437
44 43
45 6481
46 47
47 3761
48 97
49 293
50 45245801
51 101
52 22307
53 68480406462161287469
54 7761799
55 109
56 1535466241

List of values

[2, 5, 3, 29, 7, 13, 17, 197, 41, 5741, 11, 33461, 239, 269, 577, 137, 199, 37, 19, 45697, 23, 229, 1153, 1549, 79, 53, 113, 44560482149, 31, 61, 665857, 52734529, 103, 1800193921, 73, 593, 9369319, 389, 241, 1746860020068409, 4663, 11437, 43, 6481, 47, 3761, 97, 293, 45245801, 101, 22307, 68480406462161287469, 7761799, 109, 1535466241]