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 A287838 #15 May 22 2025 10:21:47
%S A287838 1,11,115,1205,12625,132275,1385875,14520125,152130625,1593906875,
%T A287838 16699721875,174966753125,1833166140625,19206495171875,
%U A287838 201230782421875,2108340300078125,22089556912890625,231437270629296875,2424820490857421875,25405391261720703125
%N A287838 Number of words of length n over the alphabet {0,1,...,10} such that no two consecutive terms have distance 8.
%C A287838 In general, the number of sequences on {0,1,...,10} such that no two consecutive terms have distance 6+k for k in {0,1,2,3,4} has generating function (-1 - x)/(-1 + 10*x + (2*k+1)*x^2).
%H A287838 Colin Barker, <a href="/A287838/b287838.txt">Table of n, a(n) for n = 0..900</a>
%H A287838 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (10,5).
%F A287838 For n > 2, a(n) = 10*a(n-1) + 5*a(n-2), a(0)=1, a(1)=11, a(2)=115.
%F A287838 G.f.: (-1 - x)/(-1 + 10*x + 5*x^2).
%F A287838 a(n) = (((5-sqrt(30))^n*(-6+sqrt(30)) + (5+sqrt(30))^n*(6+sqrt(30)))) / (2*sqrt(30)). - _Colin Barker_, Nov 25 2017
%t A287838 LinearRecurrence[{10, 5}, {1, 11, 115}, 20]
%o A287838 (Python)
%o A287838 def a(n):
%o A287838 if n in [0,1,2]:
%o A287838 return [1, 11, 115][n]
%o A287838 return 10*a(n-1) + 5*a(n-2)
%o A287838 (PARI) Vec((1 + x) / (1 - 10*x - 5*x^2) + O(x^40)) \\ _Colin Barker_, Nov 25 2017
%Y A287838 Cf. A040000, A003945, A083318, A078057, A003946, A126358, A003946, A055099, A003947, A015448, A126473. A287804-A287819. A287825-A287839.
%K A287838 nonn,easy
%O A287838 0,2
%A A287838 _David Nacin_, Jun 07 2017