G. C. Greubel, <a href="/A123169/b123169_1.txt">Table of n, a(n) for n = 1..1000</a>
G. C. Greubel, <a href="/A123169/b123169_1.txt">Table of n, a(n) for n = 1..1000</a>
proposed
approved
editing
proposed
(Magma) [n eq 1 select 1 0 else (3 + (-1)^n)*(2*n-3): n in [1..100]]; // G. C. Greubel, Jul 19 2023
proposed
editing
editing
proposed
a(1) = 0, for n >= 1 , a(2n2*n) =16n 16*n - 12, a(2n2*n+1) =8n 8*n - 2.
a(n) = (3+(-1)^n)*(-3+2*n) for n>1. a(n) = 2*a(n-2)-a(n-4) for n>5. G.f.: 2*x^2*(x^3+6*x^2+3*x+2) / ((x-1)^2*(x+1)^2). - Colin Barker, Jun 28 2013
From Colin Barker, Jun 28 2013: (Start)
a(n) = (3 + (-1)^n)*(-3 + 2*n) for n > 1.
a(n) = 2*a(n-2) - a(n-4) for n > 5.
G.f.: 2*x^2*(2+3*x+6*x^2+x^3)/((1-x)^2*(1+x)^2). (End)
LinearRecurrence[{0, 2, 0, -1}, {0, 4, 6, 20, 14}, 100] (* G. C. Greubel, Jul 19 2023 *)
(Magma) [n eq 1 select 1 else (3 + (-1)^n)*(2*n-3): n in [1..100]]; // G. C. Greubel, Jul 19 2023
(SageMath) [(3+(-1)^n)*(2*n-3) + 2*int(n==1) for n in range(1, 101)] # G. C. Greubel, Jul 19 2023
approved
editing
proposed
approved
editing
proposed
<a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (0,2,0,-1).
a(n) = (3+(-1)^n)*(-3+2*n) for n>1. a(n) = 2*a(n-2)-a(n-4) for n>5. G.f.: 2*x^2*(x^3+6*x^2+3*x+2) / ((x-1)^2*(x+1)^2). - Colin Barker, Jun 28 2013
A123169:=n->(3+(-1)^n)*(-3+2*n): 0, seq(A123169(n), n=2..100); # Wesley Ivan Hurt, Apr 27 2017
approved
editing