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 A230326 #12 Oct 17 2013 21:33:43 %S A230326 1,4,29,460,10701,329794,12310961,538586627,26959384899,1518185815760 %N A230326 Number of nonisomorphic strongly connected binary n-state automata without output under input permutations. %D A230326 A. Kisielewicz and M. Szykuła. Generating Small Automata and the Černý Conjecture. In Implementation and Application of Automata, volume 7982 of LNCS, pages 340-348, 2013. %e A230326 For n=2 there are 4 such automata: [0 a 1,0 b 1,1 a 0,1 b 0], [0 a 0,0 b 1,1 a 0,1 b 0], [0 a 0,0 b 1,1 a 1,1 b 0] and [0 a 0,0 b 1,1 a 0,1 b 1]. %Y A230326 Cf. A054745, A054746, A027835. %K A230326 nonn,hard,more %O A230326 1,2 %A A230326 _Marek Szykula_, Oct 16 2013