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.

A132850 a(0)=1; a(n) = the smallest prime dividing (n+a(n-1)), for n>=1.

Table of values

n a(n)
0 1
1 2
2 2
3 5
4 3
5 2
6 2
7 3
8 11
9 2
10 2
11 13
12 5
13 2
14 2
15 17
16 3
17 2
18 2
19 3
20 23
21 2
22 2
23 5
24 29
25 2
26 2
27 29
28 3
29 2
30 2
31 3
32 5
33 2
34 2
35 37
36 73
37 2
38 2
39 41
40 3
41 2
42 2
43 3
44 47
45 2
46 2
47 7
48 5
49 2
50 2
51 53
52 3
53 2
54 2
55 3
56 59
57 2
58 2
59 61
60 11
61 2
62 2
63 5
64 3
65 2
66 2
67 3
68 71
69 2
70 2
71 73
72 5
73 2
74 2
75 7
76 83
77 2
78 2
79 3
80 83
81 2
82 2
83 5
84 89
85 2
86 2
87 89
88 3
89 2
90 2
91 3
92 5
93 2
94 2

List of values

[1, 2, 2, 5, 3, 2, 2, 3, 11, 2, 2, 13, 5, 2, 2, 17, 3, 2, 2, 3, 23, 2, 2, 5, 29, 2, 2, 29, 3, 2, 2, 3, 5, 2, 2, 37, 73, 2, 2, 41, 3, 2, 2, 3, 47, 2, 2, 7, 5, 2, 2, 53, 3, 2, 2, 3, 59, 2, 2, 61, 11, 2, 2, 5, 3, 2, 2, 3, 71, 2, 2, 73, 5, 2, 2, 7, 83, 2, 2, 3, 83, 2, 2, 5, 89, 2, 2, 89, 3, 2, 2, 3, 5, 2, 2]