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.

A361929 a(1) = 2; for n > 1, a(n) is the smallest positive integer > 1 not to share a factor with terms a(n-c .. n-1) where c = gcd(n-1,a(n-1)).

Table of values

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

List of values

[2, 3, 2, 3, 2, 3, 5, 2, 3, 7, 2, 3, 5, 2, 3, 7, 2, 3, 5, 2, 3, 7, 2, 3, 5, 11, 2, 3, 2, 3, 5, 2, 3, 7, 2, 3, 5, 2, 3, 7, 2, 3, 5, 2, 3, 7, 2, 3, 5, 2, 3, 7, 2, 3, 5, 11, 2, 3, 2, 3, 5, 2, 3, 7, 2, 3, 5, 2, 3, 7, 11, 2, 3, 2, 5, 7, 2, 3, 5, 2, 3, 7, 2, 3, 5, 11]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.