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.

A381183 a(n) = the smallest positive integer that produces a product that contains the digit 2 when multiplied by 2 at most n times, and where a further multiplication by 2 produces a number that does not contain the digit 2. Set a(n) = -1 if no such number exists.

Table of values

n a(n)
0 2
1 1
2 6
3 31
4 128
5 64
6 516
7 331
8 814
9 1607
10 4107
11 10158
12 10258
13 5129
14 10283
15 12819
16 25633
17 28141
18 16163
19 51404
20 80134
21 80864
22 40633
23 80216
24 40108
25 128129
26 250627
27 160626
28 80313
29 125641
30 208141
31 383814
32 391628
33 195814
34 156766
35 196314
36 391563
37 490641
38 806166
39 785313
40 628222
41 314111
42 625322
43 312661
44 1563305
45 2630104
46 1315052
47 657526
48 328763
49 1643815

List of values

[2, 1, 6, 31, 128, 64, 516, 331, 814, 1607, 4107, 10158, 10258, 5129, 10283, 12819, 25633, 28141, 16163, 51404, 80134, 80864, 40633, 80216, 40108, 128129, 250627, 160626, 80313, 125641, 208141, 383814, 391628, 195814, 156766, 196314, 391563, 490641, 806166, 785313, 628222, 314111, 625322, 312661, 1563305, 2630104, 1315052, 657526, 328763, 1643815]