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.
A069831
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.
Terms
- a(0) =1a(1) =0a(2) =0a(3) =1a(4) =1a(5) =1a(6) =2a(7) =3a(8) =3a(9) =5a(10) =8a(11) =10a(12) =13a(13) =16a(14) =22a(15) =29a(16) =36a(17) =45a(18) =61a(19) =74a(20) =95a(21) =118a(22) =152a(23) =183a(24) =232a(25) =279a(26) =354a(27) =422a(28) =524a(29) =627
External references
- oeis: A069831