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.

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

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