login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A027934 a(0)=0, a(1)=1, a(2)=2; for n > 2, a(n) = 3*a(n-1) - a(n-2) - 2*a(n-3). 21

%I

%S 0,1,2,5,11,24,51,107,222,457,935,1904,3863,7815,15774,31781,63939,

%T 128488,257963,517523,1037630,2079441,4165647,8342240,16702191,

%U 33433039,66912446,133899917,267921227,536038872,1072395555,2145305339

%N a(0)=0, a(1)=1, a(2)=2; for n > 2, a(n) = 3*a(n-1) - a(n-2) - 2*a(n-3).

%C Number of compositions of n with at least one even part (offset 2). - _Vladeta Jovovic_, Dec 29 2004

%C First differences of A008466. a(n) = A008466(n+2) - A008466(n+1). - _Alexander Adamchuk_, Apr 06 2006

%C Starting with "1" = eigensequence of a triangle with the Fibonacci series as the left border and the rest 1's. - _Gary W. Adamson_, Jul 24 2010

%C An elephant sequence, see A175654. For the corner squares 24 A[5] vectors, with decimal values between 11 and 416, lead to this sequence (without the leading 0). For the central square these vectors lead to the companion sequence A099036 (without the first leading 1). - _Johannes W. Meijer_, Aug 15 2010

%C a(n) = Sum_{k=1..n} A108617(n,k) / 2. - _Reinhard Zumkeller_, Oct 07 2012

%C a(n) is the number of binary strings that contain the substring 11 or end in 1. a(3) = 5 because we have: 001, 011, 101, 110, 111. - _Geoffrey Critzer_, Jan 04 2014

%C a(n-1), n >= 1, is the number of nonexisting (due to the maturation delay) "[male-female] pairs of Fibonacci rabbits" at the beginning of the n-th month. - _Daniel Forgues_, May 06 2015

%H Reinhard Zumkeller, <a href="/A027934/b027934.txt">Table of n, a(n) for n = 0..1000</a>

%H Patrick Letendre, <a href="https://arxiv.org/abs/1911.00480">Polynomials with integer roots</a>, arXiv:1911.00480 [math.NT], 2019. See p. 4.

%H Augustine O. Munagi, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL21/Munagi/munagi10.html">Integer Compositions and Higher-Order Conjugation</a>, J. Int. Seq., Vol. 21 (2018), Article 18.8.5.

%H Denis Neiter and Amsha Proag, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL19/Proag/proag3.html">Links Between Sums Over Paths in Bernoulli's Triangles and the Fibonacci Numbers</a>, Journal of Integer Sequences, Vol. 19 (2016), Article 16.8.3.

%H OEIS Wiki, <a href="/wiki/Fibonacci_rabbits">Fibonacci rabbits</a>

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

%F a(n) = Sum_{j=0..floor(n/2)} Sum_{k=0..n-2*j} binomial(n-j, n-2*j-k). - _Paul Barry_, Feb 07 2003

%F From _Paul Barry_, Jan 23 2004: (Start)

%F Row sums of A105809.

%F G.f.: x*(1-x)/((1-2*x)*(1-x-x^2)).

%F a(n) = 2^n - Fibonacci(n+1). (End) - corrected Apr 06 2006 and Oct 05 2012

%F a(n) = Sum_{j=0..n} Sum_{k=0..n} binomial(n-k, k+j). - _Paul Barry_, Aug 29 2004

%F a(n) = (Sum of (n+1)-th row of the triangle in A108617) / 2. - _Reinhard Zumkeller_, Jun 12 2005

%F a(n) = term (1,1) - term (2,2) in the 3 X 3 matrix [2,0,0; 0,1,1; 0,1,0]^n. - _Alois P. Heinz_, Jul 28 2008

%F a(n) = 2^n - (1/2)*(1/2 + (1/2)*sqrt(5))^n - (1/10)*(1/2 +(1/2)*sqrt(5))^n *sqrt(5) + (1/10)*sqrt(5)*(1/2 - (1/2)*sqrt(5))^n - (1/2)*(1/2 - (1/2)*sqrt(5))^n, with n >= 0. - _Paolo P. Lava_, Oct 02 2008

%F a(n) = 2^n - A000045(n+1). - _Geoffrey Critzer_, Jan 04 2014

%F a(n) ~ 2^n. - _Daniel Forgues_, May 06 2015

%F From _Bob Selcoe_, Mar 29 2016: (Start)

%F a(n) = 2*a(n-1) + A000045(n-2).

%F a(n) = 4*a(n-2) + A000032(n-2). (End)

%F a(n) = 2^(n-1) - ( ((1+sqrt(5))/2)^n - ((1-sqrt(5))/2)^n)/sqrt(5). - _Haider Ali Abdel-Abbas_, Aug 17 2019

%p A027934:= proc(n) local K; K:= Matrix ([[2,0,0], [0,1,1], [0,1,0]])^n; K[1,1]-K[2,2] end: seq (A027934(n), n=0..31); # _Alois P. Heinz_, Jul 28 2008

%p a := n -> 2^n - combinat:-fibonacci(n+1): seq(a(n),n=0..31); # _Peter Luschny_, May 09 2015

%t nn=31; a:=1/(1-x-x^2); b:=1/(1-2x); CoefficientList[Series[a*x*(1+x*b), {x,0,nn}], x] (* _Geoffrey Critzer_, Jan 04 2014 *)

%t LinearRecurrence[{3,-1,-2}, {0,1,2}, 32] (* _Jean-Fran├žois Alcover_, Jan 09 2016 *)

%o (Haskell)

%o a027934 n = a027934_list !! n

%o a027934_list = 0 : 1 : 2 : zipWith3 (\x y z -> 3 * x - y - 2 * z)

%o (drop 2 a027934_list) (tail a027934_list) a027934_list

%o -- _Reinhard Zumkeller_, Oct 07 2012

%o (PARI) a(n)=2^n-fibonacci(n+1) \\ _Charles R Greathouse IV_, Jun 11 2015

%o (MAGMA) [2^n - Fibonacci(n+1): n in [0..35]]; // _G. C. Greubel_, Sep 27 2019

%o (Sage) [2^n - fibonacci(n+1) for n in (0..35)] # _G. C. Greubel_, Sep 27 2019

%o (GAP) List([0..35], n-> 2^n - Fibonacci(n+1) ); # _G. C. Greubel_, Sep 27 2019

%Y Row sums of triangle A131767. - _Gary W. Adamson_, Jul 13 2007

%Y a(n) = A101220(1, 2, n+1).

%Y T(n, n) + T(n, n+1) + ... + T(n, 2n), T given by A027926.

%Y Diagonal sums of A055248.

%Y Cf. A000045, A000079, A008466, A059570, A099036, A047967, A000032.

%K nonn,easy

%O 0,3

%A _Clark Kimberling_

%E Simpler definition from _Miklos Kristof_, Nov 24 2003

%E Initial zero added by _N. J. A. Sloane_, Feb 13 2008

%E Definition fixed by _Reinhard Zumkeller_, Oct 07 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 22 10:59 EST 2019. Contains 329389 sequences. (Running on oeis4.)