%I #15 Sep 28 2018 05:01:56
%S 1,1,1,2,2,3,4,6,7,10,13,18,23,31,40,54,69,91,118,155,199,260,334,433
%N Number of right-shifted down-sets of size n.
%C See Gordon et al. (2010) for precise definition.
%H Daniel M. Gordon, Victor S. Miller and Peter Ostapenko, <a href="http://arxiv.org/abs/0806.3284">Optimal hash functions for approximate matches on the n-cube</a>, arXiv:0806.3284 [cs.IT], 2008_2009.
%H Daniel M. Gordon, Victor S. Miller and Peter Ostapenko, <a href="http://dx.doi.org/10.1109/TIT.2009.2039037">Optimal hash functions for approximate matches on the n-cube</a>, IEEE Transactions on Information Theory 56.3 (2010): 984-991.
%K nonn,more
%O 1,4
%A _N. J. A. Sloane_, Jun 25 2016