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.

A127064 a(0)=1. a(n) = a(prime(n)(mod n)) + 1, where prime(n) is the n-th prime.

Table of values

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

List of values

[1, 2, 3, 4, 5, 3, 3, 5, 5, 4, 5, 5, 3, 4, 3, 4, 4, 6, 6, 6, 6, 6, 5, 4, 7, 6, 5, 6, 5, 6, 5, 5, 5, 4, 5, 5, 6, 5, 6, 6, 5, 5, 5, 7, 7, 7, 5, 5, 6, 6, 7, 7, 6, 7, 6, 6, 7, 6, 7, 6, 6, 7, 8, 7, 7, 8, 8, 8, 9, 4, 5, 5, 6, 4, 5, 6, 5, 6, 6, 4, 5, 4, 6, 5, 5, 4, 5, 4, 7, 5, 5, 4, 7, 6, 7, 8, 5, 8, 6, 6, 6, 6, 6, 7, 7]