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.

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

This page as a plain text file.
%I A247441 #9 Jul 23 2025 11:35:18
%S A247441 342,342,171,171,171,57,114,171,342,57,114,342,342,342,171,171,38,20,
%T A247441 19
%N A247441 Base-n state complexity of partitioned deterministic finite automaton (PDFA) for the periodic sequence (123...19)*.
%H A247441 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 A247441 Cf. A176059, A217515 - A217518, A247387, A247390, A247391.
%K A247441 nonn,more
%O A247441 2,1
%A A247441 _Vincenzo Librandi_, Sep 20 2014