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.

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

This page as a plain text file.
%I A247437 #7 Jul 23 2025 11:34:52
%S A247437 60,61,30,31,16,60,60,31,16,30,61,60,30,16,15,60,61,30,31
%N A247437 Base-n state complexity of partitioned deterministic finite automaton (PDFA) for the periodic sequence (123...15)*.
%H A247437 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 A247437 Cf. A176059, A217515 - A217518, A247387, A247390, A247391.
%K A247437 nonn,more
%O A247437 2,1
%A A247437 _Vincenzo Librandi_, Sep 20 2014