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

 

Logo


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

%I

%S 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,

%T 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,

%U 42,21,42,14,8,7,21,42,21,42,14,8,7,21,42,21,42,14,8,7

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

%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).

%H <a href="/index/Rec">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,0,0,1).

%F 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).

%t 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]

%o (MAGMA) &cat[[21, 42, 21, 42, 14, 8,7]: n in [0..30]];

%Y Cf. A176059, A217515 - A217518.

%K nonn,easy

%O 2,1

%A _Vincenzo Librandi_, Sep 16 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 16 01:14 EDT 2019. Contains 328038 sequences. (Running on oeis4.)