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.

A340161 a(n) is the smallest number k for which the set {k + 1, k + 2, ..., k + k} contains exactly n elements with exactly three 1-bits (A014311).

Table of values

n a(n)
0 1
1 4
2 6
3 7
4 10
5 11
6 13
7 18
8 19
9 21
10 25
11 34
12 35
13 37
14 41
15 49
16 66
17 67
18 69
19 73
20 81
21 97
22 130
23 131
24 133
25 137
26 145
27 161
28 193
29 258
30 259
31 261
32 265
33 273
34 289
35 321
36 385
37 514
38 515
39 517
40 521
41 529
42 545
43 577
44 641
45 769
46 1026
47 1027
48 1029
49 1033
50 1041
51 1057
52 1089
53 1153
54 1281
55 1537

List of values

[1, 4, 6, 7, 10, 11, 13, 18, 19, 21, 25, 34, 35, 37, 41, 49, 66, 67, 69, 73, 81, 97, 130, 131, 133, 137, 145, 161, 193, 258, 259, 261, 265, 273, 289, 321, 385, 514, 515, 517, 521, 529, 545, 577, 641, 769, 1026, 1027, 1029, 1033, 1041, 1057, 1089, 1153, 1281, 1537]