|
%I #28 Oct 27 2023 22:09:05
%S 1,2,5,8,15,24,41,66,109,176,287,464,753,1218,1973,3192,5167,8360,
%T 13529,21890,35421,57312,92735,150048,242785,392834,635621,1028456,
%U 1664079,2692536,4356617,7049154,11405773,18454928,29860703,48315632
%N a(n) = 2*Fibonacci(n+2) + ((-1)^n - 3)/2.
%C Fibonacci-like numbers made from _Asher Auel_'s triangle A(n,m) (A051597) satisfying A(0,0)=1, A(1,0)=2, A(1,1)=2, etc..: then a(0)=1, a(1)=2, a(n) = A(n,0) + A(n-1,1) + A(n-2,2) + ...
%C Equals row sums of triangle A153864. - _Gary W. Adamson_, Jan 03 2009
%H Harry J. Smith, <a href="/A066629/b066629.txt">Table of n, a(n) for n = 0..250</a>
%H <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (1, 2, -1, -1).
%F Lim_{n->inf} a(n)/a(n-1) = (1+sqrt(5))/2. If n even: a(n) = a(n-1) + a(n-2) + 2; if n odd: a(n) = a(n-1) + a(n-2) + 1.
%F G.f.: (1+x+x^2)/((1-x-x^2)(1-x)(1+x)). - _R. J. Mathar_, Sep 19 2008
%F a(0)=1, a(1)=2, a(2)=5, a(3)=8, a(n)=a(n-1)+2*a(n-2)-a(n-3)-a(n-4). - _Harvey P. Dale_, Oct 09 2011
%e a(5) = A(5,0) + A(4,1) + A(3,2) = 6 + 11 + 7 = 24.
%p A066629 := proc(n)
%p 2*combinat[fibonacci](n+2)+((-1)^n-3)/2 ;
%p end proc:
%p seq(A066629(n),n=0..10) ; # _R. J. Mathar_, Apr 13 2016
%t Join[{b=1},a=0;Table[If[OddQ[a]&&EvenQ[b],c=a+b+2,c=a+b+1];a=b;b=c,{n,0,5!}]] (* _Vladimir Joseph Stephan Orlovsky_, Jan 10 2011 *)
%t Table[2Fibonacci[n+2]+((-1)^n-3)/2,{n,0,40}] (* or *) LinearRecurrence[ {1,2,-1,-1},{1,2,5,8},41] (* _Harvey P. Dale_, Oct 09 2011 *)
%o (PARI) print1(y=1,",",z=2,","); for(n=2,35,print1(a=z+y+2-n%2,","); y=z; z=a)
%o (PARI) { for (n=0, 250, a=2*fibonacci(n+2) + ((-1)^n - 3)/2; write("b066629.txt", n, " ", a) ) } \\ _Harry J. Smith_, Mar 14 2010
%Y Cf. A051597.
%Y Cf. A153864. - _Gary W. Adamson_, Jan 03 2009
%K easy,nonn
%O 0,2
%A _Miklos Kristof_, Dec 18 2002
|
