login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A091949 a(n) = A087659(n) mod 2. 0

%I #7 Mar 30 2012 18:39:22

%S 1,0,1,1,1,1,0,0,1,0,1,1,1,0,1,1,1,0,1,1,1,1,0,0,1,0,1,1,1,1,0,0,1,0,

%T 1,1,1,1,0,0,1,0,1,1,1,0,1,1,1,0,1,1,1,1,0,0,1,0,1,1,1,0,1,1,1,0,1,1,

%U 1,1,0,0,1,0,1,1,1,0,1,1,1,0,1,1,1,1,0,0,1,0,1,1,1,1,0,0,1,0,1,1,1,1,0,0,1

%N a(n) = A087659(n) mod 2.

%F a(n)=hypergeom([ -n, (n+4)/2, (n+5)/2], [3, 2], -4) mod 2; a(8k)=1, a(8k+1)=0, a(8k+2)=1 a(8k+3)=0, a(8k+4)=0, a(8k+5)= 035263(k+1), a(8k+6)=1-035263(k+1), a(8k+7)=A035263(k+1)

%o (PARI) a(n)= sum(i=0,n,2*binomial(n,i)*(n+2*i+3)!/((i+1)!*(i+2)!*(n+3)!))%2

%K nonn

%O 0,1

%A _Benoit Cloitre_, Mar 11 2004

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 16:45 EDT 2024. Contains 371989 sequences. (Running on oeis4.)