[go: up one dir, main page]
login
The OEIS is supported by the many generous donors to the OEIS Foundation.
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
Search: a324263 -id:a324263
Displaying 1-1 of 1 result found.
page 1
     Sort: relevance | references | number | modified | created      Format: long | short | data
A324244
Triangle read by rows: T(n,k) is the number of connected graphs on n nodes with k peripheral nodes.
+10
3
1, 0, 1, 0, 1, 1, 0, 2, 2, 2, 0, 5, 4, 7, 5, 0, 25, 20, 16, 23, 28, 0, 185, 146, 119, 57, 123, 223, 0, 2459, 1728, 1523, 948, 405, 903, 3151, 0, 58156, 36109, 32119, 24637, 13927, 4713, 11746, 79673, 0, 2617378, 1446609, 1304109, 1026845, 723871, 353620, 110734, 279535, 3853870
(list; graph; refs; listen; history; text; internal format)
CROSSREFS
Column k=2 is A324263.
page 1

Search completed in 0.005 seconds

Lookup Welcome Wiki Register Music Plot 2 Demos Index WebCam Contribute Format Style Sheet Transforms Superseeker Recents
The OEIS Community
Maintained by The OEIS Foundation Inc.
Last modified November 8 01:15 EST 2024. Contains 377537 sequences.
License Agreements, Terms of Use, Privacy Policy