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.

A132222 Beatty sequence 1+2*floor(n*Pi/2), which contains infinitely many primes.

Table of values

n a(n)
0 1
1 3
2 7
3 9
4 13
5 15
6 19
7 21
8 25
9 29
10 31
11 35
12 37
13 41
14 43
15 47
16 51
17 53
18 57
19 59
20 63
21 65
22 69
23 73
24 75
25 79
26 81
27 85
28 87
29 91
30 95
31 97
32 101
33 103
34 107
35 109
36 113
37 117
38 119
39 123
40 125
41 129
42 131
43 135
44 139
45 141
46 145
47 147
48 151
49 153
50 157
51 161
52 163
53 167
54 169
55 173
56 175
57 179
58 183
59 185
60 189

List of values

[1, 3, 7, 9, 13, 15, 19, 21, 25, 29, 31, 35, 37, 41, 43, 47, 51, 53, 57, 59, 63, 65, 69, 73, 75, 79, 81, 85, 87, 91, 95, 97, 101, 103, 107, 109, 113, 117, 119, 123, 125, 129, 131, 135, 139, 141, 145, 147, 151, 153, 157, 161, 163, 167, 169, 173, 175, 179, 183, 185, 189]