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.

A071292 Call f(n) the sum of the first n primes then a(n) is the number of squares between f(n) and f(n+1).

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 2, 1, 1, 2, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 1, 2, 2, 1, 2, 1, 2, 1, 2, 1, 2, 2, 1, 2, 1, 2, 2, 1, 2, 1, 2, 2, 1, 2, 1, 2, 2, 1, 2, 2, 1, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 2, 1, 2, 2, 1, 2, 2, 2]