|
%I #17 Dec 27 2023 15:24:39
%S 4,1,5,2,-1,3,0,4,1,5,2,6,3,0,4,1,5,2,6,3,7,4,1,5,2,6,3,7,4,8,5,2,6,3,
%T 7,4,8,5,9,6,3,7,4,8,5,9,6,10,7,4,8,5,9,6,10,7,11,8,5,9,6,10,7,11,8,
%U 12,9,6,10,7,11,8,12,9,13,10,7,11,8,12,9,13,10,14,11,8,12,9,13,10,14,11
%N First coordinate of (2,7)-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*(-3*x^8 + 4*x^7 - 3*x^6 + 4*x^5 - 3*x^4 - 3*x^3 + 4*x^2 - 3*x + 4)/(x^10 - x^9 - x + 1). (End)
%F a(n) = 4*n - 7*floor((5*n + 2)/9). - _Ridouane Oudra_, Dec 28 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)... 4..1..5..2.-1..3..0..4..1..5...2...6...3
%e y(n).. -1..0.-1..0..1..0..1..0..1..0...1...0...1
%t c = 2; d = 7;
%t x1 = {4, 1, 5, 2, -1, 3, 0, 4, 1}; y1 = {-1, 0, -1, 0, 1, 0, 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}] (* A194512 *)
%t Table[y[n], {n, 1, 100}] (* A194513 *)
%t Table[y[n], {n, 1, 100}]
%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}]]
%t LinearRecurrence[{1,0,0,0,0,0,0,0,1,-1},{4,1,5,2,-1,3,0,4,1,5},100] (* _Harvey P. Dale_, Dec 27 2023 *)
%Y Cf. A194508, A194513.
%K sign
%O 1,1
%A _Clark Kimberling_, Aug 28 2011
|
