%I #42 Aug 03 2024 19:22:10
%S 5,19,31,101,179,655,1189,4451,8111,30469,55555,208799,380741,1431091,
%T 2609599,9808805,17886419,67230511,122595301,460804739,840280655,
%U 3158402629,5759369251,21648013631,39475304069,148377692755,270567759199,1016995835621,1854499010291
%N a(n) is the integer w such that (c(n)^2, -d(n)^2, -w) is a primitive solution to the Diophantine equation 2*x^3 + 2*y^3 + z^3 = 11^3, where c(n) = F(n+2) + (-1)^n * F(n-3), d(n) = F(n+1) + (-1)^n * F(n-4) and F(n) is the n-th Fibonacci number (A000045).
%C Conjecture:
%C (i) For all k > 2, 2*x^3 + 2*y^3 + z^3 = A089270(k)^3 have primitive solutions form (c(n)^2, -d(n)^2, -w(n)) with d(n) = 3*d(n-2) - d(n-4), c(n) = d(n+2) - d(n) and w(n) = 8*w(n-2) - 8*w(n-4) + w(n-6).
%C (ii) This sequence is a subsequence of A089270.
%C From _XU Pingya_, Jun 07 2024: (Start)
%C Several positive examples of conjecture:
%C When A089270(4,5,6,7) = {19,29,31,41}, d(n) can be taken as:
%C (1/2) * (F(n+3) + (-1)^n * F(n-6));
%C ((1-(-1)^n)/2) * (F(n+3) + F(n-4)) + ((1+(-1)^n)/2) * (F(n+3) - F(n-4));
%C ((1-(-1)^n)/2) * (2*F(n-1) + 3*F(n-3)) + ((1+(-1)^n)/2) * (3*F(n-2) + 2*F(n-4));
%C and
%C ((1-(-1)^n)/2) * (2*F(n+1) + F(n-5)) + ((1+(-1)^n)/2) * (F(n+2) + 2*F(n-4)).
%C When A089270(17) = 121, d(n) can be taken as d(1,2,3,4) = {-3,0,7,11}. (End)
%C From _XU Pingya_, Jul 17 2024: (Start)
%C Furthermore, we observe that if (x, y) (y < x/2) is the solution of the Diophantine equation x^2 + x * y - y^2 = A089270(k). Let
%C d(2*n-1) = x * F(2*n-2) - y * F(2*n-3), c(2*n-1) = d(2*n+1) - d(2*n-1);
%C d(2*n) = x * F(2*n-2) + y * F(2*n-1), c(2*n) = d(2*n+2) - d(2*n).
%C Then such c(n) and d(n) satisfy the conjecture. (End)
%H <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (1,7,-7,-1,1).
%F a(n) = (-1331 + 2 * A237132(n)^6 - 2 * A228208(n-1)^6)^(1/3).
%F a(n) = ((1-(-1)^n)/2) * (-1 + 6 * Sum_{k=0..n-1} Fibonacci(4*k-1) + 14 * Sum_{k=0..n-2} Fibonacci(4*k+1)) + ((1+(-1)^n)/2) * (-1 + 6 * Sum_{k=0..n-1} Fibonacci(4*k-1) + 14 * Sum_{k=0..n-1} Fibonacci(4*k+1)).
%F a(n) = ((1-(-1)^n)/2) * (-1 + 6*A206351(n) + 14*A081016(n-2)) + ((1+(-1)^n)/2) * (-1 + 6*A206351(n) + 14*A081016(n-1)).
%F From _Stefano Spezia_, Aug 25 2022: (Start)
%F G.f.: x*(5 + 14*x - 23*x^2 - 28*x^3 - x^4)/((1 - x)*(1 - 3*x + x^2)*(1 + 3*x + x^2)).
%F a(n) = a(n-1) + 7*a(n-2) - 7*a(n-3) - a(n-4) + a(n-5) for n > 5. (End)
%F From _XU Pingya_, Jul 17 2024: (Start)
%F a(2*n-1) = (F(2*n) + F(2*n-2) + F(2*n-5))^2 + (F(2*n) + F(2*n-2) + F(2*n-5)) * (F(2*n-2) + F(2*n-4) + F(2*n-7)) - (F(2*n-2) + F(2*n-4) + F(2*n-7))^2;
%F a(2*n) = (F(2*n+2) + F(2*n-3))^2 + (F(2*n+2) + F(2*n-3)) * (F(2*n) + F(2*n-5)) - (F(2*n) + F(2*n-5))^2. (End)
%e For n=3, 2 * ((F(5) - F(0))^2)^3 + 2 * (-(F(4) - F(-1))^2)^3 + (-31)^3 = 2 * 25^3 - 2 * 4^3 - 31^3 = 1331, a(3) = 31.
%t Table[(-1331+2*((Fibonacci[n+2]+(-1)^n*Fibonacci[n-3]))^6-2*(Fibonacci[n+1]+(-1)^n*Fibonacci[n-4])^6)^(1/3), {n,28}]
%Y Cf. A000045, A081016, A089270, A206351, A228208, A237132.
%Y Cf. also A337928, A354336, A356717.
%K nonn,easy
%O 1,1
%A _XU Pingya_, Aug 24 2022