Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
a(n) = a(n-2)+a(n-4); a(1)=a(4)=101, a(2)=a(3)=10.
1

%I #25 Jan 04 2024 15:50:09

%S 101,10,10,101,111,111,121,212,232,323,353,535,585,858,938,1393,1523,

%T 2251,2461,3644,3984,5895,6445,9539,10429,15434,16874,24973,27303,

%U 40407,44177,65380,71480,105787,115657,171167,187137,276954,302794,448121,489931

%N a(n) = a(n-2)+a(n-4); a(1)=a(4)=101, a(2)=a(3)=10.

%C Generalization of A115339.

%H Colin Barker, <a href="/A180236/b180236.txt">Table of n, a(n) for n = 1..1000</a>

%H <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (0,1,0,1).

%F G.f.: -x*(91*x^3-91*x^2+10*x+101) / (x^4+x^2-1). _Colin Barker_, Oct 03 2015

%t LinearRecurrence[{0,1,0,1},{101,10,10,101},50] (* _Paolo Xausa_, Jan 04 2024 *)

%o (PARI) Vec(-x*(91*x^3-91*x^2+10*x+101)/(x^4+x^2-1) + O(x^100)) \\ _Colin Barker_, Oct 03 2015

%o (PARI) a(n) = if(n==1||n==4, 101, if(n==2||n==3, 10, a(n-2)+a(n-4))); \\ _Altug Alkan_, Oct 03 2015

%Y Cf. A115339, A000045, A000032.

%K nonn,easy

%O 1,1

%A _Mark Dols_, Aug 18 2010