A339592 - OEIS

A339592

Number of independent sets in Motzkin graph on n nodes.

2, 3, 4, 7, 9, 13, 17, 26, 29, 48, 55, 95

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

REFERENCES

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.

LINKS

Table of n, a(n) for n=1..12.

Gi-Sang Cheon, Ji-Hwan Jung, Bumtle Kang, Hana Kim, Suh-Ryung Kim, Sergey Kitaev, and Seyed Ahmad Mojallal, Counting independent sets in Riordan graphs, arXiv:2006.16579 [math.CO], 30 Jun 2020.

CROSSREFS

Sequence in context: A181385 A188381 A005576 * A241131 A339397 A129373

Adjacent sequences: A339589 A339590 A339591 * A339593 A339594 A339595

KEYWORD

nonn,more

AUTHOR

N. J. A. Sloane, Dec 28 2020

STATUS

approved