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 A085359 #6 Sep 30 2023 21:45:56
%S A085359 1,3,6,7,9,12,16,15,15,21,30,30,28,30,36,31,27,33,48,51,51,54,66,60,
%T A085359 52,60,78,76,66,66,76,63,51,57,78,81,81,90,114,105,93,111,144,138,120,
%U A085359 126,150,126,100,108,144,148,138,138,166,150,126,138,174,168,142,138,156
%N A085359 Third self-convolution of A085357 (residues of binomial(3k,k)/(2k+1) modulo 2).
%C A085359 a(n) - A085357(n-1) is always even for n > 0.
%F A085359 G.f.: 1 + x*A(x) = A085357(x)^3 (mod 2), where A085357(x) = Sum_{k>=0} A085357(k)*x^k.
%Y A085359 Cf. A001764 (ternary trees), A085357.
%K A085359 nonn
%O A085359 0,2
%A A085359 _Paul D. Hanna_, Jun 25 2003