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.

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

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