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.

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

List of values

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