OFFSET
4,2
COMMENTS
a(n) gives the number of unique ways a directed graph of n vertices with outdegree 1 can be broken into smaller components of size >= 2. It can be generalized to higher degree by replacing A329426 in the formula with a suitable counting function.
LINKS
Stephen Dunn, Table of n, a(n) for n = 4..100
EXAMPLE
PROG
CROSSREFS
KEYWORD
nonn
AUTHOR
Stephen Dunn, Nov 30 2019
EXTENSIONS
Term a(26) corrected by Sidney Cadot, Jan 06 2023.
STATUS
approved