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.

A096057 a(1) = 1, a(n) = least prime divisor of b(n), where b(1) = 1, b(n) = n*b(n-1) + 1 = A002627(n).

Table of values

n a(n)
1 1
2 3
3 2
4 41
5 2
6 1237
7 2
8 29
9 2
10 43
11 2
12 5
13 2
14 5
15 2
16 35951249665217
17 2
18 28001
19 2
20 1409
21 2
22 5
23 2
24 5
25 2
26 47
27 2
28 661
29 2
30 13
31 2
32 5
33 2
34 5
35 2
36 13
37 2
38 13
39 2
40 73
41 2
42 5
43 2
44 5
45 2
46 71
47 2
48 2437159
49 2
50 31
51 2
52 5
53 2
54 5
55 2
56 13
57 2
58 3020497643
59 2
60 23
61 2
62 5
63 2
64 5
65 2
66 5672529813439
67 2
68 15336863

List of values

[1, 3, 2, 41, 2, 1237, 2, 29, 2, 43, 2, 5, 2, 5, 2, 35951249665217, 2, 28001, 2, 1409, 2, 5, 2, 5, 2, 47, 2, 661, 2, 13, 2, 5, 2, 5, 2, 13, 2, 13, 2, 73, 2, 5, 2, 5, 2, 71, 2, 2437159, 2, 31, 2, 5, 2, 5, 2, 13, 2, 3020497643, 2, 23, 2, 5, 2, 5, 2, 5672529813439, 2, 15336863]