login
Base-5 state complexity of partitioned deterministic finite automaton (PDFA) for the periodic sequence (123...n)*.
19

%I #9 Sep 20 2014 07:37:36

%S 2,6,4,6,12,42,16,54,11,55,24,52,84,31,64,272,108,171,21

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

%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. base-k state complexity of partitioned deterministic finite automaton (PDFA) for the periodic sequence (12...n)*: A217519 (k=2), A217520 (k=3), A217521 (k=4), this sequence (k=5), A247567 (k=6), A247568 (k=7), A247569 (k=8), A247570 (k=9), A247571 (k=10), A247572 (k=11), A247573 (k=12), A247574 (k=13), A247575 (k=14), A247576 (k=15), A247577 (k=16), A247578 (k=17), A247579 (k=18), A247580 (k=19), A247581 (k=20).

%K nonn,more

%O 2,1

%A _Vincenzo Librandi_, Sep 20 2014