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.

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

This page as a plain text file.
%I A247442 #10 Jul 23 2025 11:35:24
%S A247442 83,80,41,21,27,80,81,40,31,40,81,80,55,41,21,80,99,40,21
%N A247442 Base-n state complexity of partitioned deterministic finite automaton (PDFA) for the periodic sequence (123...20)*.
%H A247442 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 A247442 Cf. A176059, A217515 - A217518, A247387, A247390, A247391.
%K A247442 nonn,more
%O A247442 2,1
%A A247442 _Vincenzo Librandi_, Sep 20 2014