Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A101204
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A101204 Triangle read by rows: T(n,k) = number of planar trivalent (or cubic) multigraphs with 2n nodes and exactly k double bonds, for 0 <= k <= n. +0
3
1, 0, 1, 1, 0, 1, 1, 1, 2, 1, 3, 4, 5, 4, 1, 9, 16, 22, 16, 7, 1, 32, 75, 112, 86, 41, 10, 1, 133 (list; table; graph; listen)
page 1

Search completed in 0.001 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 6 22:55 EST 2009. Contains 170429 sequences.


AT&T Labs Research