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 A230401 #15 Oct 19 2013 06:13:09 %S A230401 1,4,51,1115,34265,1318699,60477844,3210707626,193589241468, %T A230401 13070085476528 %N A230401 Number of nonisomorphic synchronizing binary n-state automata without output under input permutations. %C A230401 An automaton with the state set Q is synchronizing if there exists a word w such that |Qw|=1. %D A230401 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 A230401 For n=2 there are 4 such automata: %e A230401 [0 a 0,0 b 1,1 a 0,1 b 0], %e A230401 [0 a 0,0 b 0,1 a 0,1 b 0], %e A230401 [0 a 0,0 b 1,1 a 0,1 b 1], and %e A230401 [0 a 0,0 b 0,1 a 1,1 b 0]. %Y A230401 Cf. A054745, A054746, A230326. %K A230401 nonn,hard,more %O A230401 1,2 %A A230401 _Marek Szykula_, Oct 18 2013