A247569 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A247569

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

1

3, 6, 5, 20, 13, 7, 9, 18, 41, 110, 25, 52, 15, 60, 25, 136, 37, 114, 81

(list; graph; refs; listen; history; text; internal format)

OFFSET

2,1

LINKS

Table of n, a(n) for n=2..20.

Klaus Sutner and Sam Tetruashvili, Inferring automatic sequences (see table on the p. 5).

CROSSREFS

Cf. similar sequences listed in A247566.

Sequence in context: A334079 A328403 A199126 * A115389 A303564 A121867

Adjacent sequences: A247566 A247567 A247568 * A247570 A247571 A247572

KEYWORD

nonn,more

AUTHOR

Vincenzo Librandi, Sep 20 2014

STATUS

approved