Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A129622
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A129622
%S A129622 24,1028,56014,3705306,286717796,25493886852
%N A129622 Number of minimal deterministic finite automata with n states on a two-letter 
               alphabet.
%D A129622 Frederique Bassino, Julien David and Cyril Nicaud. REGAL: a library to 
               randomly and exhaustively generate automata. 2007.
%H A129622 Frederique Bassino, Julien David and Cyril Nicaud, <a href="http://igm.univ-mlv.fr/
               ~jdavid01/Publications.php">REGAL: a library to randomly and exhaustively 
               generate automata.</a>.
%Y A129622 Cf. A059412, A000282.
%Y A129622 Sequence in context: A033590 A006175 A058810 this_sequence A112011 A112010 
               A046906
%Y A129622 Adjacent sequences: A129619 A129620 A129621 this_sequence A129623 A129624 
               A129625
%K A129622 nonn
%O A129622 2,1
%A A129622 Johnicholas Hines (johnicholas.hines(AT)gmail.com), May 30 2007

    
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 16 17:18 EST 2009. Contains 170825 sequences.


AT&T Labs Research