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 (123...18)*
0

%I #6 Sep 20 2014 07:35:52

%S 109,22,55,108,25,54,37,19,19,108,31,54,109,34,55,36,19,18,109

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

%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, A247390, A247391.

%K nonn,more

%O 2,1

%A _Vincenzo Librandi_, Sep 20 2014