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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A085405 Common residues of binomial(3n+2,n+1)/(3n+2) modulo 2. 6
 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS The positions of ones are given by A022340 and runs of zeros are given by A085407: both are related to the Fibonacci sequence. LINKS Antti Karttunen, Table of n, a(n) for n = 0..65539 Index entries for characteristic functions FORMULA a(n) = C(3n+2, n+1)/(3n+2) (Mod 2) = A006013(n) (Mod 2), where A006013 is the self-convolution of A001764 (ternary trees). a(n) = A323239(A005940(1+n)). - Antti Karttunen, Jan 12 2019 PROG (PARI) A085405(n) = ((binomial((3*n)+2, n+1)/((3*n)+2))%2); \\ Antti Karttunen, Jan 12 2019 (PARI) A085405(n) = if(n%2, 0, while(n>0, my(nextn=(n>>1)); if(1==(nextn%2)*(n%2), return(0)); n = nextn); (1)); \\ (Much faster than above program) - Antti Karttunen, Jan 12 2019 CROSSREFS Cf. A005940, A006013, A022340 (ones), A085407 (zeros), A085357, A277332, A323239. Sequence in context: A284957 A357385 A316533 * A036988 A108357 A309848 Adjacent sequences: A085402 A085403 A085404 * A085406 A085407 A085408 KEYWORD nonn AUTHOR Paul D. Hanna, Jun 29 2003 STATUS approved

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

Last modified September 19 11:33 EDT 2024. Contains 376010 sequences. (Running on oeis4.)