This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A085405 #14 Jan 12 2019 20:45:26 %S A085405 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, %T A085405 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, %U A085405 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 %N A085405 Common residues of binomial(3n+2,n+1)/(3n+2) modulo 2. %C A085405 The positions of ones are given by A022340 and runs of zeros are given by A085407: both are related to the Fibonacci sequence. %H A085405 Antti Karttunen, <a href="/A085405/b085405.txt">Table of n, a(n) for n = 0..65539</a> %H A085405 <a href="/index/Ch#char_fns">Index entries for characteristic functions</a> %F A085405 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). %F A085405 a(n) = A323239(A005940(1+n)). - _Antti Karttunen_, Jan 12 2019 %o A085405 (PARI) A085405(n) = ((binomial((3*n)+2, n+1)/((3*n)+2))%2); \\ _Antti Karttunen_, Jan 12 2019 %o A085405 (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 %Y A085405 Cf. A005940, A006013, A022340 (ones), A085407 (zeros), A085357, A277332, A323239. %K A085405 nonn %O A085405 0,1 %A A085405 _Paul D. Hanna_, Jun 29 2003