The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A317060 a(n) is the number of time-dependent assembly trees satisfying the edge gluing rule for a cycle on n vertices. 2
 1, 1, 3, 14, 85, 642, 5782, 60484, 720495, 9627210, 142583430, 2318126196, 41042117558, 786002475244, 16189215818220, 356847596226840, 8381418010559225, 208967274455769810, 5511890008010697306 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS A time-dependent assembly tree for a connected graph G=(V, E) on n vertices is a rooted tree, each node of which is label a subset U of V and a nonnegative integer i such that: 1) each internal node has at least two children, 2) there are leaves labeled (v, 0) for each vertex v in V, 3) the label on the root is (V, m) for 1 <= m <= n-1, 4) for each node (U, i) with i < m, U is the union of the {u} for the children (u, 0) of (U, i), 5) if (U, i) and (U', i') are adjacent nodes with U a subset of U', then i

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.

Last modified June 13 07:45 EDT 2021. Contains 344981 sequences. (Running on oeis4.)