A247387 - OEIS

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

A247387

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

21, 42, 21, 42, 14, 8, 7, 21, 42, 21, 42, 14, 8, 7, 21, 42, 21, 42, 14, 8, 7, 21, 42, 21, 42, 14, 8, 7, 21, 42, 21, 42, 14, 8, 7, 21, 42, 21, 42, 14, 8, 7, 21, 42, 21, 42, 14, 8, 7, 21, 42, 21, 42, 14, 8, 7, 21, 42, 21, 42, 14, 8, 7, 21, 42, 21, 42, 14, 8, 7

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

OFFSET

2,1

LINKS

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

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

Index entries for linear recurrences with constant coefficients, signature (0,0,0,0,0,0,1).

FORMULA

G.f.: x^2*(21 + 42*x + 21*x^2 + 42*x^3 + 14*x^4 + 8*x^5 + 7*x^6)/(1-x^7).

MATHEMATICA

CoefficientList[Series[(21 + 42 x + 21 x^2 + 42 x^3 + 14 x^4 + 8 x^5 + 7 x^6)/(1 - x^7), {x, 0, 40}], x]

PROG