The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A091949 a(n) = A087659(n) mod 2. 0
 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, 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, 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS FORMULA 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) PROG (PARI) a(n)= sum(i=0, n, 2*binomial(n, i)*(n+2*i+3)!/((i+1)!*(i+2)!*(n+3)!))%2 CROSSREFS Sequence in context: A181656 A090971 A105594 * A039984 A153639 A319102 Adjacent sequences:  A091946 A091947 A091948 * A091950 A091951 A091952 KEYWORD nonn AUTHOR Benoit Cloitre, Mar 11 2004 STATUS approved

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 April 7 00:54 EDT 2020. Contains 333291 sequences. (Running on oeis4.)