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.

A368111 Least k such that there are exactly A003586(n) ways to choose a binary index of each binary index of k.

Table of values

n a(n)
1 1
2 4
3 64
4 20
5 68
6 52
7 1088
8 84
9 308
10 1092
11 116
12 5184
13 820
14 1108
15 372
16 5188
17 2868
18 1140
19 13376
20 884
21 5204
22 17204
23 1396
24 13380
25 2932
26 5236
27 275520
28 19252
29 1908
30 13396
31 17268
32 5492
33 275524
34 84788
35 3956
36 13428
37 1324096
38 19316
39 6004
40 275540
41 215860
42 18292
43 13684

List of values

[1, 4, 64, 20, 68, 52, 1088, 84, 308, 1092, 116, 5184, 820, 1108, 372, 5188, 2868, 1140, 13376, 884, 5204, 17204, 1396, 13380, 2932, 5236, 275520, 19252, 1908, 13396, 17268, 5492, 275524, 84788, 3956, 13428, 1324096, 19316, 6004, 275540, 215860, 18292, 13684]

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

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