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.

A231180 Let A={2,3,6,8,9,11,14,...} be the sequence of numbers k>=1 such that k+5 is odious (A000069). Let B be the complement of A. The sequence lists numbers for which the number of A-divisors equals the number of B-divisors.

Table of values

n a(n)
1 1
2 4
3 9
4 16
5 36
6 121
7 144
8 289
9 441
10 484
11 529
12 1156
13 1369
14 1600
15 1764
16 2025
17 2116
18 2209
19 3249
20 3481
21 4624
22 5041
23 5476
24 6241
25 6889
26 7056
27 7569
28 7921
29 8100
30 8464
31 8649
32 8836
33 11449
34 12321
35 12769
36 12996
37 13924
38 14641
39 15129
40 16641
41 20164
42 24336
43 24649
44 24964

List of values

[1, 4, 9, 16, 36, 121, 144, 289, 441, 484, 529, 1156, 1369, 1600, 1764, 2025, 2116, 2209, 3249, 3481, 4624, 5041, 5476, 6241, 6889, 7056, 7569, 7921, 8100, 8464, 8649, 8836, 11449, 12321, 12769, 12996, 13924, 14641, 15129, 16641, 20164, 24336, 24649, 24964]