[go: up one dir, main page]

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

%I #7 Sep 20 2014 14:11:53

%S 2,3,4,20,6,14,16,27,40,110,12,14,28,60,64,68,54,342,80

%N Base-13 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. similar sequences listed in A247566.

%K nonn,more

%O 2,1

%A _Vincenzo Librandi_, Sep 20 2014