login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A357895 Number of partitions of the complete graph on n vertices into strokes. 1
1, 2, 12, 472, 104800 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Partition of graph G=(V,E) into strokes is a collection of directed edge-disjoint trails (viewed as sets of directed edges, cf. A357857) in G such that (i) no two trails can be concatenated into a single one; (ii) the corresponding undirected edges form a partition of E.
LINKS
CROSSREFS
Sequence in context: A296623 A009510 A091471 * A012625 A012630 A013173
KEYWORD
nonn,more,walk
AUTHOR
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 21 20:02 EST 2024. Contains 370237 sequences. (Running on oeis4.)