|
%I #15 Dec 29 2020 10:21:14
%S -1,-2,2,1,0,-1,3,2,1,0,-1,3,2,1,0,4,3,2,1,0,4,3,2,1,5,4,3,2,1,5,4,3,
%T 2,6,5,4,3,2,6,5,4,3,7,6,5,4,3,7,6,5,4,8,7,6,5,4,8,7,6,5,9,8,7,6,5,9,
%U 8,7,6,10,9,8,7,6,10,9,8,7,11,10,9,8,7,11,10,9,8,12,11,10,9,8,12,11,10,9
%N First coordinate of (4,5)-Lagrange pair for n.
%C See A194508.
%H <a href="/index/Rec#order_10">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,0,0,0,0,0,1,-1).
%F From _Chai Wah Wu_, Jan 21 2020: (Start)
%F a(n) = a(n-1) + a(n-9) - a(n-10) for n > 10.
%F G.f.: x*(-x^8 - x^7 + 4*x^6 - x^5 - x^4 - x^3 + 4*x^2 - x - 1)/(x^10 - x^9 - x + 1). (End)
%F a(n) = 4*n - 5*floor((7*n + 4)/9). - _Ridouane Oudra_, Dec 29 2020
%e This table shows (x(n),y(n)) for 1<=n<=13:
%e n...... 1..2..3..4..5..6..7..8..9..10..11..12..13
%e x(n).. -1.-2..2..1..0.-1..3..2..1..0..-1...3...2
%e y(n)... 1..2..1..0..1..2.-1..0..1..2...3...2...1
%t Remove["Global`*"];
%t c = 4; d = 5;
%t x1 = {-1, -2, 2, 1, 0, -1, 3, 2, 1}; y1 = {1, 2, 1, 0, 1, 2, -1, 0, 1};
%t x[n_] := If[n <= c + d, x1[[n]], x[n - c - d] + 1]
%t y[n_] := If[n <= c + d, y1[[n]], y[n - c - d] + 1]
%t Table[x[n], {n, 1, 100}] (* A194522 *)
%t Table[y[n], {n, 1, 100}] (* A194523 *)
%t r[1, n_] := n; r[2, n_] := x[n]; r[3, n_] := y[n]
%t TableForm[Table[r[m, n], {m, 1, 3}, {n, 1, 30}]]
%Y Cf. A194508, A194523.
%K sign
%O 1,2
%A _Clark Kimberling_, Aug 28 2011
|
