login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Base-n state complexity of partitioned deterministic finite automaton (PDFA) for the periodic sequence (123456789)*.
1

%I #9 Sep 19 2014 05:29:16

%S 54,13,27,54,16,27,18,10,9,54,19,27,54,19,27,18,10,9,54

%N Base-n state complexity of partitioned deterministic finite automaton (PDFA) for the periodic sequence (123456789)*.

%H Klaus Sutner and Sam Tetruashvili, <a href="http://www.cs.cmu.edu/~sutner/papers/auto-seq.pdf ">Inferring automatic sequences</a> (see table on the p. 5).

%Y Cf. A176059, A217515 - A217518, A247387.

%K nonn,more

%O 2,1

%A _Vincenzo Librandi_, Sep 16 2014