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.

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

This page as a plain text file.
%I A247438 #9 Jul 23 2025 11:34:59
%S A247438 31,64,21,64,55,32,25,32,59,64,29,64,63,32,17,16,65,64,33
%N A247438 Base-n state complexity of partitioned deterministic finite automaton (PDFA) for the periodic sequence (123...16)*.
%H A247438 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 A247438 Cf. A176059, A217515 - A217518, A247387, A247390, A247391.
%K A247438 nonn,more
%O A247438 2,1
%A A247438 _Vincenzo Librandi_, Sep 20 2014