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.

A291926 a(n) is the smallest integer k>=0 such that 2^k contains every digit in base n, or 0 if no such integer exists.

Table of values

n a(n)
2 1
3 5
4 0
5 18
6 25
7 20
8 0
9 61
10 68
11 64
12 72
13 103
14 110
15 134
16 0
17 138
18 141
19 140
20 141
21 172
22 191
23 228
24 225
25 244
26 306
27 281
28 272
29 339
30 384
31 412
32 0
33 390
34 421
35 372
36 472
37 395
38 441
39 486
40 495
41 473
42 566
43 576
44 629
45 735
46 626
47 661
48 706
49 707
50 741
51 825
52 782
53 751
54 811
55 924
56 930
57 908
58 927
59 975
60 1049
61 934
62 1018
63 1070
64 0

List of values

[1, 5, 0, 18, 25, 20, 0, 61, 68, 64, 72, 103, 110, 134, 0, 138, 141, 140, 141, 172, 191, 228, 225, 244, 306, 281, 272, 339, 384, 412, 0, 390, 421, 372, 472, 395, 441, 486, 495, 473, 566, 576, 629, 735, 626, 661, 706, 707, 741, 825, 782, 751, 811, 924, 930, 908, 927, 975, 1049, 934, 1018, 1070, 0]