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.
%I A331850 #23 Sep 28 2021 09:06:45
%S A331850 1,2,4,9,18,54,120,324,900,2406,6400,19600,50176,148042,442325,
%T A331850 1373070,3954113
%N A331850 Largest cardinality of a set obtained by self-shuffling a binary word of length n.
%C A331850 The self-shuffle of a length-n word w is the set of all length-2n words that can be obtained by interleaving w with itself, as in the shuffle of a deck of cards (but not a perfect shuffle).
%F A331850 For n = 1..17 the values a(n) are achieved by the lexicographically least strings given below:
%F A331850 1 : 0
%F A331850 2 : 01
%F A331850 3 : 010
%F A331850 4 : 0110
%F A331850 5 : 00110
%F A331850 6 : 011001
%F A331850 7 : 0110001
%F A331850 8 : 01100110
%F A331850 9 : 011000110
%F A331850 10 : 0110001110
%F A331850 11 : 01110001110
%F A331850 12 : 011100001110
%F A331850 13 : 0111000001110
%F A331850 14 : 01100011110001
%F A331850 15 : 011000011110001
%F A331850 16 : 0111000011110001
%F A331850 17 : 01110000011110001
%e A331850 For n = 3 one can obtain {010010, 001010, 010100, 001100} by self-shuffling 010, so a(3) = 4.
%o A331850 (Python) # uses a() in A191755; a(n)[2] generates the lex. least argmax
%o A331850 print([a(n)[1] for n in range(1, 9)]) # _Michael S. Branicky_, Sep 28 2021
%Y A331850 Cf. A191755.
%K A331850 nonn,more
%O A331850 1,2
%A A331850 _Jeffrey Shallit_, Jan 29 2020
%E A331850 a(11)-a(13) from _Giovanni Resta_, Jan 29 2020
%E A331850 a(14)-a(15) from _Giovanni Resta_, Jan 30 2020
%E A331850 a(16)-a(17) from _Bert Dobbelaere_, Feb 08 2020