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.

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

List of values

[1, 2, 0, 2, 2, 2, 0, 2, 1, 2, 1, 3, 1, 3, 1, 3, 3, 2, 3, 3, 5, 4, 1, 4, 3, 4, 2, 4, 4, 2, 4, 4, 4, 3, 3, 4, 3, 4, 5, 5, 5, 4, 4, 6, 6, 3, 3, 9, 4, 5, 6, 9, 4, 6, 4, 4, 8, 6, 5, 7, 5, 9, 5, 5, 7, 8, 6, 11, 5, 9, 4, 7, 9, 9, 6, 10, 5, 5, 17, 4, 10, 9, 10, 7, 3, 3, 10, 8, 7, 10, 6, 9, 5, 10, 10, 10, 8, 11, 6, 9, 10, 7, 7, 7, 7, 12, 9, 11, 13, 9, 12, 6, 10, 9, 6]