login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A049340 Triangle T(n,k) = number of planar graphs with n >= 1 nodes and 0<=k<=C(n,2) edges, all degrees even. 1
1, 1, 1, 0, 1, 1, 0, 0, 1, 2, 1, 0, 0, 1, 1, 0, 0, 3, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 6, 1, 0, 0, 1, 1, 1, 3, 2, 2, 1, 1, 1, 0, 0, 0, 14, 1, 0, 0, 1, 1, 1, 3, 4, 4, 6, 5, 5, 3, 2, 0, 0, 0, 0, 0, 0, 0, 0, 36, 1, 1, 1, 1, 3, 4, 7, 9, 15, 17, 22, 14, 16, 5, 4, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,10

LINKS

Table of n, a(n) for n=1..95.

EXAMPLE

1; 1,1; 0,1,1,0; 0,1,2,1,0,0,1; 1,0,0,3,1,0,0,1,1,1; 1,1,0,0,0,6,1,0,0...

CROSSREFS

Cf. A049339, A000944, A021103, A003094, A049334.

Sequence in context: A046080 A170967 A035227 * A321888 A321750 A056929

Adjacent sequences:  A049337 A049338 A049339 * A049341 A049342 A049343

KEYWORD

nonn,tabf,easy,nice

AUTHOR

Brendan McKay

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 March 21 12:09 EDT 2019. Contains 321369 sequences. (Running on oeis4.)