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.

A231175 Let A={2,4,5,8,9,11,14,...} be the sequence of numbers k>=1 such that k+1 is evil (A001969), and let B be the complement of A. The sequence lists numbers for which number of A-divisors equals number of B-divisors.

Table of values

n a(n)
1 1
2 4
3 25
4 100
5 121
6 289
7 361
8 529
9 625
10 841
11 1156
12 2116
13 2209
14 2500
15 2809
16 3249
17 3364
18 3481
19 4489
20 5041
21 5929
22 6241
23 7225
24 7921
25 10201
26 11236
27 11449
28 12769
29 12996
30 15625
31 17161
32 20164
33 21025
34 22201
35 28900
36 29584
37 30625
38 31329
39 31684
40 32041
41 36481
42 38809
43 40804

List of values

[1, 4, 25, 100, 121, 289, 361, 529, 625, 841, 1156, 2116, 2209, 2500, 2809, 3249, 3364, 3481, 4489, 5041, 5929, 6241, 7225, 7921, 10201, 11236, 11449, 12769, 12996, 15625, 17161, 20164, 21025, 22201, 28900, 29584, 30625, 31329, 31684, 32041, 36481, 38809, 40804]