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.

A152810 Let the binary expansion of n be n = Sum_{k} 2^{r_k}, let e(n) be the number of r_k's that are even, o(n) the number that are odd; sequence gives odd n such that e(n) > o(n) and e(n)-o(n) == 1 or 2 (mod 6).

Table of values

n a(n)
1 1
2 5
3 7
4 13
5 17
6 19
7 23
8 25
9 29
10 31
11 37
12 49
13 53
14 55
15 61
16 65
17 67
18 71
19 73
20 77
21 79
22 83
23 89
24 91
25 95
26 97
27 101
28 103
29 109
30 113
31 115
32 119
33 121
34 125
35 127
36 133
37 145
38 149
39 151
40 157
41 181
42 193
43 197
44 199
45 205
46 209
47 211
48 215
49 217
50 221
51 223
52 229
53 241
54 245
55 247
56 253
57 257
58 259

List of values

[1, 5, 7, 13, 17, 19, 23, 25, 29, 31, 37, 49, 53, 55, 61, 65, 67, 71, 73, 77, 79, 83, 89, 91, 95, 97, 101, 103, 109, 113, 115, 119, 121, 125, 127, 133, 145, 149, 151, 157, 181, 193, 197, 199, 205, 209, 211, 215, 217, 221, 223, 229, 241, 245, 247, 253, 257, 259]