login
A339591
Number of independent sets in Pascal graph on n nodes.
0
2, 3, 4, 6, 7, 12, 15, 23, 24, 46, 60, 98
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
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: A092591 A287924 A039947 * A096477 A039059 A151892
KEYWORD
nonn,more
AUTHOR
N. J. A. Sloane, Dec 28 2020
STATUS
approved