OFFSET
1,2
COMMENTS
A well-defined solution sequence for recurrence a(n) = a(n-a(n-4)) + a(n-a(n-5)).
LINKS
Colin Barker, Table of n, a(n) for n = 1..1000
Index entries for linear recurrences with constant coefficients, signature (0,0,1,0,0,1,0,0,-1).
FORMULA
For k > 2:
a(6*k-4) = 9,
a(6*k-3) = 6*k-2,
a(6*k-2) = 6*k,
a(6*k-1) = 6,
a(6*k) = 6*k-2,
a(6*k+1) = 6*k.
From Colin Barker, Aug 05 2019: (Start)
G.f.: x*(1 + 3*x + 6*x^2 + 5*x^3 - x^4 - 3*x^6 + x^7 - 2*x^8 + 3*x^9 + x^10 + 2*x^11 - x^13 - 3*x^16 - 2*x^17 + 2*x^18 + 2*x^20 - 2*x^21) / ((1 - x)^2*(1 + x)*(1 - x + x^2)*(1 + x + x^2)^2).
a(n) = a(n-3) + a(n-6) - a(n-9) for n > 22.
(End)
MATHEMATICA
a[n_] := a[n] = If[n < 8, {1, 3, 6, 6, 2, 6, 4}[[n]], a[n - a[n-4]] + a[n - a[n-5]]]; Array[a, 87] (* Giovanni Resta, Aug 07 2019 *)
PROG
(PARI) q=vector(100); q[1]=1; q[2]=3; q[3]=q[4]=q[6]=6; q[5]=2; q[7]=4; for(n=8, #q, q[n] = q[n-q[n-4]]+q[n-q[n-5]]); q
(PARI) Vec(x*(1 + 3*x + 6*x^2 + 5*x^3 - x^4 - 3*x^6 + x^7 - 2*x^8 + 3*x^9 + x^10 + 2*x^11 - x^13 - 3*x^16 - 2*x^17 + 2*x^18 + 2*x^20 - 2*x^21) / ((1 - x)^2*(1 + x)*(1 - x + x^2)*(1 + x + x^2)^2) + O(x^80)) \\ Colin Barker, Aug 15 2019
(Magma) I:=[1, 3, 6, 6, 2, 6, 4]; [n le 7 select I[n] else Self(n-Self(n-4))+Self(n-Self(n-5)): n in [1..90]]; // Marius A. Burtea, Aug 07 2019
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Altug Alkan, Aug 05 2019
STATUS
approved