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.

A375472 Least k such that the ternary representation of 2^k has exactly 2*n 1's, or -1 if no such k exists.

Table of values

n a(n)
0 1
1 2
2 8
3 14
4 24
5 26
6 42
7 45
8 50
9 53
10 70
11 74
12 96
13 76
14 124
15 98
16 116
17 121
18 143
19 141
20 179
21 150
22 187
23 181
24 192
25 215
26 209
27 233
28 220
29 257
30 245
31 264
32 243
33 278
34 260
35 310
36 297
37 303
38 315
39 339
40 329
41 387
42 341
43 357
44 354
45 366
46 403
47 420
48 350
49 400
50 411
51 415
52 474
53 455
54 466
55 442

List of values

[1, 2, 8, 14, 24, 26, 42, 45, 50, 53, 70, 74, 96, 76, 124, 98, 116, 121, 143, 141, 179, 150, 187, 181, 192, 215, 209, 233, 220, 257, 245, 264, 243, 278, 260, 310, 297, 303, 315, 339, 329, 387, 341, 357, 354, 366, 403, 420, 350, 400, 411, 415, 474, 455, 466, 442]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.