Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A054748
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A054748 Number of inequivalent n-state 1-input n-output automata. +0
2
1, 6, 29, 209, 1652, 15981, 171837, 2060481, 26951143, 381398614 (list; graph; listen)
OFFSET

1,2

REFERENCES

M. A. Harrison, A census of finite automata, Canad. J. Math., 17, No. 1, 1965, 100-113.

F. Harary and E. Palmer, Graphical Enumeration, 1973.

CROSSREFS

Cf. A054732, A054749.

Sequence in context: A027248 A020090 A020036 this_sequence A143563 A122802 A051685

Adjacent sequences: A054745 A054746 A054747 this_sequence A054749 A054750 A054751

KEYWORD

more,nonn

AUTHOR

Vladeta Jovovic (vladeta(AT)eunet.rs), Apr 22 2000

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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research