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.

A277488 a(n) = number of integers one less than a prime encountered before reaching (n^2)-1 when starting from k = ((n+1)^2)-1 and iterating map k -> k - A002828(k).

Table of values

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

List of values

[0, 1, 0, 2, 1, 1, 0, 3, 2, 3, 2, 1, 1, 2, 1, 3, 2, 3, 1, 2, 4, 4, 1, 2, 3, 2, 2, 3, 4, 3, 3, 4, 3, 4, 3, 2, 4, 5, 5, 4, 4, 3, 4, 5, 4, 4, 3, 4, 6, 4, 6, 8, 4, 4, 3, 5, 7, 3, 7, 2, 6, 6, 4, 7, 7, 4, 5, 7, 4, 8, 6, 4, 4, 3, 6, 11, 4, 5, 5, 9, 6, 3, 6, 7, 6, 9, 9, 8, 11, 6, 5, 5, 7, 8, 7, 7, 5, 8, 9, 5, 7, 6, 5, 6, 7, 6, 8, 9, 6, 9, 6, 15, 8, 10, 9, 7, 10, 6, 6, 10]