This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A083593 Expansion of 1/((1-2*x)*(1-x^4)). 4

%I

%S 1,2,4,8,17,34,68,136,273,546,1092,2184,4369,8738,17476,34952,69905,

%T 139810,279620,559240,1118481,2236962,4473924,8947848,17895697,

%U 35791394,71582788,143165576,286331153,572662306,1145324612,2290649224

%N Expansion of 1/((1-2*x)*(1-x^4)).

%C Here we let p =4 to produce the above sequence, but p can be an arbitrary natural number. By letting p = 2, 3, 6, 7 we produce A000975, A033138, A195904 and A117302. We denote by U[p,n,m] the number of the cases that the first player gets killed in a Russian roulette game when p players use a gun with n-chambers and m-bullets. They never rotate the cylinder after the game starts. The chambers can be represented by the list {1,2,...,n}.

%C We are going to calculate the following (0), (1),...(t) separately. (0) The first player gets killed when one bullet is in the first chamber and the remaining (m-1)- bullets are in {2,3,...,n}. We have binomial[n-1,m-1]-cases for this. (1) The first gets killed when one bullet is in the (p+1)th chamber and the rest of the bullets are in {p+2,..,n}. We have binomial[n-p-1,m-1]-cases for this. We continue to calculate and the last is (t), where t = Floor[(n-m)/ p]. (t) The first gets killed when one bullet is in (pt+1)-th chamber and the remaining bullets are in {pt+2,...,n}. We have binomial[n-pt- 1,m-1]-cases for this. Therefore U[p,n,m] = Sum[binomial[n-pz-1,m-1], for z = 0 to t, where t = Floor[(n-m)/p]. Let A[p,n] be the number of the cases that the first player gets killed when p-player use a gun with n-chambers and the number of the bullets can be from 1 to n. Then A[p,n] = Sum[U[p,n,m], m = 1 to n]. - _Ryohei Miyadera_, Tomohide Hashiba, Yuta Nakagawa, Hiroshi Matsui, Jun 04 2006

%H Vincenzo Librandi, <a href="/A083593/b083593.txt">Table of n, a(n) for n = 0..1000</a>

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

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

%F a(n) = -1/4+[1/20-(1/10)*I]*I^n+(1/12)*(-1)^n+(16/15)*2^n+[1/20+(1/10)*I]*(-I)^n, with n>=0 and I=sqrt(-1). - _Paolo P. Lava_, Jun 10 2008

%F If n is a multiple of 4, then a(n) = 2*a(n-1) + 1, otherwise a(n) = 2*a(n-1). - _Gerald McGarvey_, Oct 14 2008

%F a(n) = floor((2^(n+5)+1)/30). - _Tani Akinari_, Jul 09 2013

%F a(n) = 2*a(n-1) + floor(((n-1) mod 4) /3), with a(0)=1. - _Andres Cicuttin_, Mar 29 2016

%F a(n) = 2*a(n-1) + 1 - ceiling[(n mod 4)/4], with a(0)=1. - _Andres Cicuttin_, Mar 29 2016

%t U[p_,n_,m_,v_]:=Block[{t},t=Floor[(1+p-m+n-v)/p];Sum[Binomial[n-v-p*z,m-1],{z,0,t-1}]]; A[p_,n_,v_]:=Sum[U[p,n,k,v],{k,1,n}]; (* Here we let p = 4 to produce the above sequence, but this code can produce A000975, A033138, A195904, A117302 for p=2,3,6,7.*) Table[A[4,n,1], {n,1,20}] (* _Ryohei Miyadera_, Tomohide Hashiba, Yuta Nakagawa, Hiroshi Matsui, Jun 04 2006 *)

%t CoefficientList[Series[1/((1-2x)(1-x^4)),{x,0,40}],x] (* _Vincenzo Librandi_, Apr 04 2012 *)

%t a[n_] := FromDigits[Table[(Mod[j, 4]/4) // Round, {j, 1, n + 3}], 2] (* _Andres Cicuttin_, Mar 25 2016 *)

%t a[n_] := a[n] = 2 a[n - 1] + 1 - Ceiling[Mod[n, 4]/4]; a[0] = 1;

%t Table[a[n], {n, 0, 31}] (* _Andres Cicuttin_, Mar 27 2016 *)

%t LinearRecurrence[{2,0,0,1,-2},{1,2,4,8,17},40] (* _Harvey P. Dale_, Apr 03 2018 *)

%o (PARI) Vec(1/((1-2*x)*(1-x^4))+O(x^99)) \\ _Charles R Greathouse IV_, May 15 2013

%o (PARI) a(n)=(16<<n)\15 \\ _Charles R Greathouse IV_, Mar 27 2016

%Y Cf. A033138, A000975, A033138, A195904, A117302.

%K easy,nonn

%O 0,2

%A _Paul Barry_, May 02 2003

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.

Last modified December 16 05:59 EST 2018. Contains 318158 sequences. (Running on oeis4.)