Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #15 Dec 29 2020 08:26:19
%S 2,3,4,7,9,13,17,26,29,48,55,95
%N Number of independent sets in Motzkin graph on n nodes.
%D Cheon, G. S., Jung, J. H., Kang, B., Kim, H., Kim, S. R., Kitaev, S., & Mojallal, S. A. (2020). Counting independent sets in Riordan graphs. Discrete Mathematics, 343(11), 112043.
%H Gi-Sang Cheon, Ji-Hwan Jung, Bumtle Kang, Hana Kim, Suh-Ryung Kim, Sergey Kitaev, and Seyed Ahmad Mojallal, <a href="https://arxiv.org/abs/2006.16579">Counting independent sets in Riordan graphs</a>, arXiv:2006.16579 [math.CO], 30 Jun 2020.
%K nonn,more
%O 1,1
%A _N. J. A. Sloane_, Dec 28 2020