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.

A077436 Let B(n) be the sum of binary digits of n. This sequence contains n such that B(n) = B(n^2).

Table of values

n a(n)
1 0
2 1
3 2
4 3
5 4
6 6
7 7
8 8
9 12
10 14
11 15
12 16
13 24
14 28
15 30
16 31
17 32
18 48
19 56
20 60
21 62
22 63
23 64
24 79
25 91
26 96
27 112
28 120
29 124
30 126
31 127
32 128
33 157
34 158
35 159
36 182
37 183
38 187
39 192
40 224
41 240
42 248
43 252
44 254
45 255
46 256
47 279
48 287
49 314
50 316
51 317
52 318
53 319
54 351
55 364
56 365
57 366
58 374
59 375
60 379
61 384

List of values

[0, 1, 2, 3, 4, 6, 7, 8, 12, 14, 15, 16, 24, 28, 30, 31, 32, 48, 56, 60, 62, 63, 64, 79, 91, 96, 112, 120, 124, 126, 127, 128, 157, 158, 159, 182, 183, 187, 192, 224, 240, 248, 252, 254, 255, 256, 279, 287, 314, 316, 317, 318, 319, 351, 364, 365, 366, 374, 375, 379, 384]