login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A247441 Base-n state complexity of partitioned deterministic finite automaton (PDFA) for the periodic sequence (123...19)* 0

%I

%S 342,342,171,171,171,57,114,171,342,57,114,342,342,342,171,171,38,20,

%T 19

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

%H 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 Cf. A176059, A217515 - A217518, A247387, A247390, A247391.

%K nonn,more

%O 2,1

%A _Vincenzo Librandi_, Sep 20 2014

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 17 23:33 EDT 2019. Contains 328135 sequences. (Running on oeis4.)