id:A049334 - OEIS Search Results

Search: id:A049334

Displaying 1-1 of 1 results found.

page 1

Triangle read by rows: T(n,k) = number of connected planar graphs with n >= 1 nodes and 0<=k<=C(n,2) edges.

+0
5

1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 2, 2, 1, 1, 0, 0, 0, 0, 3, 5, 5, 4, 2, 1, 0, 0, 0, 0, 0, 6, 13, 19, 22, 19, 13, 5, 2, 0, 0, 0, 0, 0, 0, 11, 33, 67, 107, 130, 130, 96, 51, 16, 5, 0, 0, 0, 0, 0, 0, 0, 23, 89, 236, 486, 804, 1112, 1211, 1026, 626, 275, 72, 14, 0, 0, 0, 0, 0, 0, 0, 0 (list; graph; listen)

	OFFSET	`1,11`
	EXAMPLE	`1; 0 1; 0 0 1 1; 0 0 0 2 2 1 1; 0 0 0 0 3 ...`
	CROSSREFS	`Cf. A003094.` `Sequence in context: A113080 A011265 A083747 this_sequence A054924 A025485 A046751` `Adjacent sequences: A049331 A049332 A049333 this_sequence A049335 A049336 A049337`
	KEYWORD	`nonn,tabf,easy,nice`
	AUTHOR	`Brendan McKay (bdm(AT)cs.anu.edu.au)`

page 1

Search completed in 0.002 seconds

Last modified November 21 14:49 EST 2008. Contains 150807 sequences.

AT&T Labs Research