login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A339591 Number of independent sets in Pascal graph on n nodes. 0
2, 3, 4, 6, 7, 12, 15, 23, 24, 46, 60, 98 (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: A092591 A287924 A039947 * A096477 A039059 A151892

Adjacent sequences:  A339588 A339589 A339590 * A339592 A339593 A339594

KEYWORD

nonn,more

AUTHOR

N. J. A. Sloane, Dec 28 2020

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 11 16:42 EDT 2021. Contains 342888 sequences. (Running on oeis4.)