login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

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

%I #10 Sep 19 2014 05:28:38

%S 15,16,13,16,23,16,9,8,25,16,17,16,25,16,9,8,25,16,17

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

%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