cp's OEIS Frontend

A107659 a(n) = Sum_{k=0..n} 2^max(k, n-k).

%I A107659 #17 Jun 24 2018 22:31:03
%S A107659 1,4,10,24,52,112,232,480,976,1984,4000,8064,16192,32512,65152,130560,
%T A107659 261376,523264,1047040,2095104,4191232,8384512,16771072,33546240,
%U A107659 67096576,134201344,268410880,536838144,1073692672,2147418112
%N A107659 a(n) = Sum_{k=0..n} 2^max(k, n-k).
%C A107659 Define an infinite array by m(n,k) = 2^n-n+k for n>=k>=0 (in the lower left triangle) and by m(n,k) = 2^k+k-n for k>=n>=0 (in the upper right triangle). The antidiagonal sums of this array are a(n) = sum_{k=0..n} m(n-k,k). - _J. M. Bergot_, Aug 16 2013
%H A107659 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (2,2,-4).
%F A107659 a(2n) = 2^n(2^(n+2)-3), a(2n+1) = 2^n(2^(n+3)-4).
%F A107659 G.f.: (1+2*x)/[(1-2*x)*(1-2*x^2)].
%F A107659 a(n) = A122746(n) +2*A122746(n-1). - _R. J. Mathar_, Aug 16 2013
%F A107659 a(0)=1, a(1)=4, a(2)=10, a(n)=2*a(n-1)+2*a(n-2)-4*a(n-3). - _Harvey P. Dale_, Nov 10 2013
%F A107659 a(n) = 2^(n+2) - (2 + mod(n+1, 2)) * 2^floor((n+1)/2). - _Michael Somos_, Jun 24 2018
%F A107659 a(n) = - (2^(n+2)) * A052955(-n-3) for all n in Z. - _Michael Somos_, Jun 24 2018
%e A107659 G.f. = 1 + 4*x + 10*x^2 + 24*x^3 + 52*x^4 + 112*x^5 + 232*x^6 + 480*x^7 + ... - _Michael Somos_, Jun 24 2018
%t A107659 Table[Sum[2^Max[k,n-k],{k,0,n}],{n,0,30}] (* or *) LinearRecurrence[ {2,2,-4},{1,4,10},30] (* _Harvey P. Dale_, Nov 10 2013 *)
%t A107659 a[ n_] := 2^(n + 2) - (2 + Mod[n + 1, 2]) 2^Quotient[n + 1, 2]; (* _Michael Somos_, Jun 24 2018 *)
%o A107659 (PARI) {a(n) = 2^(n+2) - (2 + (n+1)%2) * 2^((n+1)\2)}; /* _Michael Somos_, Jun 24 2018 */
%Y A107659 Cf. A027383, A052955.
%K A107659 nonn,easy
%O A107659 0,2
%A A107659 _Mitch Harris_