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.

A145818 Odd positive integers a(n) such that for every integer m == 3 (mod 4) there exists a unique representation of the form m = a(l) + 2*a(s), but there are no such representations for m == 1 (mod 4).

Table of values

n a(n)
1 1
2 5
3 17
4 21
5 65
6 69
7 81
8 85
9 257
10 261
11 273
12 277
13 321
14 325
15 337
16 341
17 1025
18 1029
19 1041
20 1045
21 1089
22 1093
23 1105
24 1109
25 1281
26 1285
27 1297
28 1301
29 1345
30 1349
31 1361
32 1365
33 4097
34 4101
35 4113
36 4117
37 4161
38 4165
39 4177
40 4181
41 4353
42 4357
43 4369
44 4373
45 4417
46 4421
47 4433

List of values

[1, 5, 17, 21, 65, 69, 81, 85, 257, 261, 273, 277, 321, 325, 337, 341, 1025, 1029, 1041, 1045, 1089, 1093, 1105, 1109, 1281, 1285, 1297, 1301, 1345, 1349, 1361, 1365, 4097, 4101, 4113, 4117, 4161, 4165, 4177, 4181, 4353, 4357, 4369, 4373, 4417, 4421, 4433]