id:A069831 - OEIS Search Results

Search: id:A069831

Displaying 1-1 of 1 results found.

page 1

Number of graphical partitions of simple Eulerian graphs (partitions given by the degrees of vertices of simple (no loops or multiple edges) graphs having only vertices of even degrees) having n edges.

+0
1

1, 0, 0, 1, 1, 1, 2, 3, 3, 5, 8, 10, 13, 16, 22, 29, 36, 45, 61, 74, 95, 118, 152, 183, 232, 279, 354, 422, 524, 627, 780, 926, 1134, 1355, 1651, 1958, 2366, 2809, 3372, 3988, 4757, 5628, 6678, 7874, 9283, 10964, 12861, 15130, 17686, 20799, 24209, 28389 (list; graph; listen)

	OFFSET	`0,7`
	EXAMPLE	`a(1)=a(2)=0 since Eulerian graphs having 1 or 2 edges are not simple. The triangle is the unique Eulerian graph having 3 edges and no isolated vertices, thus showing a(3)=1.`
	CROSSREFS	`Cf. A000569.` `Sequence in context: A053218 A154690 A046937 this_sequence A017820 A129577 A107854` `Adjacent sequences: A069828 A069829 A069830 this_sequence A069832 A069833 A069834`
	KEYWORD	`nonn`
	AUTHOR	`Roland Bacher (Roland.Bacher(AT)ujf-grenoble.fr), Apr 23 2002`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research