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 A276033 #13 Sep 07 2018 03:25:32
%S A276033 1,2,3,6,8,17,22,50,64,154,196,493,625,1626,2055,5487,6917,18851,
%T A276033 23713,65703,82499,231725,290511,825399,1033411,2964951,3707851,
%U A276033 10728256,13402696,39065521,48760366,143047486,178405156,526399066,656043856,1945668346,2423307046
%N A276033 Number of generalizations of the partition 1^n with all elements taken modulo 2.
%C A276033 Consider the ranked poset L(n) of partitions defined in A002846, and take the elements of each node modulo 2, collapsing two equivalent nodes into 1. Then a(n) is the total number of paths of all lengths 0,1,...,n-1 that start at any node in the poset and end at 1^n.
%C A276033 Odd-indexed terms are the partial sums of Catalan numbers: A014138. Even-indexed terms a_{2n} are C_n (the n-th Catalan number) less than the following odd-indexed term.
%C A276033 Originally this entry had a reference to a paper on the arXiv by Caleb Ji, Enumerative Properties of Posets Corresponding to a Certain Class of No Strategy Games, arXiv:1608.06025 [math.CO], 2016. However, this article has since been removed from the arXiv. - _N. J. A. Sloane_, Sep 07 2018
%Y A276033 Cf. A276032, A014138.
%K A276033 nonn
%O A276033 1,2
%A A276033 _Caleb Ji_, Aug 17 2016