Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A054732
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A054732 Number of inequivalent n-state 2-input 2-output automata with respect to input and output permutations. +0
8
2, 44, 2038, 176936, 20943790, 3108818680, 553255960308, 114776687721990, 27196943499525498, 7246997465494260922, 2144966703605620242622, 698192439379511764136358, 247879443355186031710674326 (list; graph; listen)
OFFSET

1,1

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

Sequence in context: A094397 A140795 A161744 this_sequence A161722 A054914 A161745

Adjacent sequences: A054729 A054730 A054731 this_sequence A054733 A054734 A054735

KEYWORD

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 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research