%I #18 Sep 07 2018 03:25:00
%S 1,2,3,7,8,21,22,63,64,195,196,624,625,2054,2055,6916,6917,23712,
%T 23713,82498,82499,290510,290511,1033410,1033411,3707850,3707851,
%U 13402695,13402696,48760365,48760366,178405155,178405156,656043855,656043856,2423307045
%N Number of refinements of the partition n^1 with all numbers taken modulo 2.
%C 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,...,n1 that start at (n mod 2)^1 and end at any node in the poset.
%C Oddindexed terms are the partial sums of Catalan numbers: A014138.
%C Evenindexed terms are one less than the following oddindexed term.
%C 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 Cf. A276033, A014138.
%K nonn
%O 1,2
%A _Caleb Ji_, Aug 17 2016
