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 A277561 #26 May 29 2017 12:59:21
%S A277561 1,2,2,2,2,4,2,2,2,4,4,4,2,4,2,2,2,4,4,4,4,8,4,4,2,4,4,4,2,4,2,2,2,4,
%T A277561 4,4,4,8,4,4,4,8,8,8,4,8,4,4,2,4,4,4,4,8,4,4,2,4,4,4,2,4,2,2,2,4,4,4,
%U A277561 4,8,4,4,4,8,8,8,4,8,4,4,4,8,8,8,8,16,8
%N A277561 a(n) = Sum_{k=0..n} ({binomial(n+2k,2k)*binomial(n,k)} mod 2).
%C A277561 Equals the run length transform of A040000: 1,2,2,2,2,2,...
%H A277561 Chai Wah Wu, <a href="/A277561/b277561.txt">Table of n, a(n) for n = 0..10000</a>
%H A277561 Chai Wah Wu, <a href="https://arxiv.org/abs/1610.06166">Sums of products of binomial coefficients mod 2 and run length transforms of sequences</a>, arXiv:1610.06166 [math.CO], 2016.
%H A277561 <a href="/index/Ru#rlt">Index entries for sequences computed with run length transform</a>
%F A277561 a(n) = 2^A069010(n). a(2n) = a(n), a(4n+1) = 2a(n), a(4n+3) = a(2n+1). - _Chai Wah Wu_, Nov 04 2016
%F A277561 a(n) = A034444(A005940(1+n)). - _Antti Karttunen_, May 29 2017
%t A277561 Table[Sum[Mod[Binomial[n + 2 k, 2 k] Binomial[n, k], 2], {k, 0, n}], {n, 0, 86}] (* _Michael De Vlieger_, Oct 21 2016 *)
%o A277561 (Python)
%o A277561 def A277561(n):
%o A277561 return sum(int(not (~(n+2*k) & 2*k) | (~n & k)) for k in range(n+1))
%o A277561 (PARI) a(n) = sum(k=0, n, binomial(n+2*k, 2*k)*binomial(n,k) % 2); \\ _Michel Marcus_, Oct 21 2016
%Y A277561 Cf. A005940, A034444, A040000, A069010, A106737.
%K A277561 nonn
%O A277561 0,2
%A A277561 _Chai Wah Wu_, Oct 19 2016