This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A006845 State assignments for n-state machine. (Formerly M2295) 2
 0, 1, 3, 3, 140, 420, 840, 840, 10810800, 75675600, 454053600, 2270268000, 9081072000, 27243216000, 54486432000, 54486432000, 52401161274029568000, 786017419110443520000, 11004243867546209280000, 143055170278100720640000 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS After the initial 0, this sequence is formed by taking in turn the last 2^(n-1) elements of row n in the irregular triangle A133709. - Sean A. Irvine, Aug 14 2017 REFERENCES F. J. Hill and G. R. Peterson, Introduction to Switching Theory and Logical Design. Wiley, NY, 3rd ed., 1981, p. 308. N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). LINKS CROSSREFS Cf. A007041, A133709. Sequence in context: A173797 A173127 A230646 * A071536 A094755 A152418 Adjacent sequences:  A006842 A006843 A006844 * A006846 A006847 A006848 KEYWORD nonn AUTHOR EXTENSIONS a(9) corrected and more terms from Sean A. Irvine, Aug 14 2017 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 15 00:30 EST 2019. Contains 329988 sequences. (Running on oeis4.)