|
Search: id:A039735
|
|
|
| A039735 |
|
Triangle read by rows: T(n,k) = number of planar graphs with n >= 1 nodes and 0<=k<=3n-6) edges. |
|
+0
4
|
|
| 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 2, 1, 1, 1, 1, 2, 4, 6, 6, 6, 4, 2, 1, 1, 1, 2, 5, 9, 15, 21, 24, 24, 20, 13, 5, 2, 1, 1, 2, 5, 10, 21, 41, 65, 97, 130, 144, 135, 98, 51, 16, 5, 1, 1, 2, 5, 11, 24, 56, 115, 221, 401, 658, 956, 1217, 1264, 1042, 631, 275, 72, 14, 1, 1, 2, 5
(list; graph; listen)
|
|
|
OFFSET
|
1,10
|
|
|
REFERENCES
|
R. C. Read and R. J. Wilson, An Atlas of Graphs, Oxford, 1998.
R. J. Wilson, Introduction to Graph Theory. Academic Press, NY, 1972, p. 162.
|
|
EXAMPLE
|
1; 1,1; 1,1,1,1; 1,1,2,3,2,1,1; 1,1,2,4,6,6...
|
|
CROSSREFS
|
Cf. A005470 (row sums), A008406.
Sequence in context: A083475 A122402 A008406 this_sequence A129385 A096626 A083279
Adjacent sequences: A039732 A039733 A039734 this_sequence A039736 A039737 A039738
|
|
KEYWORD
|
nonn,tabf,nice
|
|
AUTHOR
|
Brendan McKay (bdm(AT)cs.anu.edu.au)
|
|
|
Search completed in 0.002 seconds
|
