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.

A125121 Sturdy numbers: n such that in binary notation k*n has at least as many 1-bits as n for all k>0.

Table of values

n a(n)
1 1
2 2
3 3
4 4
5 5
6 6
7 7
8 8
9 9
10 10
11 12
12 14
13 15
14 16
15 17
16 18
17 20
18 21
19 24
20 28
21 30
22 31
23 32
24 33
25 34
26 35
27 36
28 40
29 42
30 45
31 48
32 49
33 51
34 56
35 60
36 62
37 63
38 64
39 65
40 66
41 68
42 69
43 70
44 72
45 73
46 75
47 80
48 84
49 85
50 89
51 90
52 93
53 96
54 98
55 102
56 105
57 112
58 120
59 124
60 126
61 127
62 128
63 129
64 130
65 132
66 133
67 135
68 136

List of values

[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16, 17, 18, 20, 21, 24, 28, 30, 31, 32, 33, 34, 35, 36, 40, 42, 45, 48, 49, 51, 56, 60, 62, 63, 64, 65, 66, 68, 69, 70, 72, 73, 75, 80, 84, 85, 89, 90, 93, 96, 98, 102, 105, 112, 120, 124, 126, 127, 128, 129, 130, 132, 133, 135, 136]