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.

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

This page as a plain text file.
%I A247434 #9 Jul 23 2025 11:34:34
%S A247434 27,25,13,24,19,24,25,13,23,24,13,12,37,25,13,24,25,24,25
%N A247434 Base-n state complexity of partitioned deterministic finite automaton (PDFA) for the periodic sequence (123.....12)*.
%H A247434 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 A247434 Cf. A176059, A217515 - A217518, A247387, A247390, A247391.
%K A247434 nonn,more
%O A247434 2,1
%A A247434 _Vincenzo Librandi_, Sep 19 2014