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 A259482 #25 Aug 30 2020 04:17:09
%S A259482 2,6,44,2014,1651377
%N A259482 Number of states in smallest deterministic finite automaton that accepts exactly the strings over the alphabet {1,2,...,n} having all permutations of 12...n as subsequences.
%C A259482 The automaton is assumed to be "complete"; that is, there is a transition from every state on every letter.
%C A259482 Also, the length of the shortest string accepted by this automaton is the sequence A062714.
%H A259482 Kevin Ryde, <a href="/A259482/a259482.pl.txt">Perl program running Foma or SFST to construct the DFAs</a>
%e A259482 For n = 2 there is a 6-state automaton accepting (11*22*1 + 22*11*2)(1 + 2)*.
%Y A259482 Cf. A062714.
%K A259482 nonn,hard,more,nice
%O A259482 1,1
%A A259482 _Jeffrey Shallit_, Jun 28 2015
%E A259482 a(5) from _Kevin Ryde_, Aug 21 2020