cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A247388 #10 Sep 19 2014 05:28:38
%S A247388 15,16,13,16,23,16,9,8,25,16,17,16,25,16,9,8,25,16,17
%N A247388 Base-n state complexity of partitioned deterministic finite automaton (PDFA) for the periodic sequence (12345678)*.
%H A247388 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 A247388 Cf. A176059, A217515 - A217518, A247387.
%K A247388 nonn,more
%O A247388 2,1
%A A247388 _Vincenzo Librandi_, Sep 16 2014