This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A217517 #16 Sep 08 2022 08:46:04
%S A217517 20,20,10,6,5,20,20,10,6,5,20,20,10,6,5,20,20,10,6,5,20,20,10,6,5,20,
%T A217517 20,10,6,5,20,20,10,6,5,20,20,10,6,5,20,20,10,6,5,20,20,10,6,5,20,20,
%U A217517 10,6,5,20,20,10,6,5,20,20,10,6,5,20,20,10,6,5
%N A217517 Base-n state complexity of partitioned deterministic finite automaton (PDFA) for the periodic sequence (12345)*.
%C A217517 Ultimately periodic with period length 5.
%H A217517 Klaus Sutner and Sam Tetruashvili, <a href="http://www.cs.cmu.edu/~sutner/papers/auto-seq.pdf ">Inferring automatic sequences</a>, p. 5 (Table 1).
%H A217517 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,1).
%F A217517 G.f.: x^2*(20 + 20*x + 10*x^2 + 6*x^3 + 5*x^4)/(1 - x^5). - _Vincenzo Librandi_, Nov 18 2012
%t A217517 CoefficientList[Series[(20 + 20 x + 10 x^2 + 6 x^3 + 5 x^4)/(1 - x^5), {x, 0, 30}], x] (* _Vincenzo Librandi_, Nov 18 2012 *)
%o A217517 (Magma) &cat[[20, 20, 10, 6, 5]: n in [0..30]]; // _Vincenzo Librandi_, Nov 18 2012
%K A217517 nonn,easy
%O A217517 2,1
%A A217517 _N. J. A. Sloane_, Oct 07 2012