A247580 - 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

A247580

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

1

2, 3, 8, 10, 6, 42, 16, 9, 20, 110, 24, 156, 84, 30, 64, 136, 18, 20, 40

(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: A133165 A019307 A342849 * A345352 A028742 A028771

Adjacent sequences: A247577 A247578 A247579 * A247581 A247582 A247583

KEYWORD

nonn,more

AUTHOR

Vincenzo Librandi, Sep 20 2014

STATUS

approved