OFFSET
0,2
COMMENTS
a(n) is also the number of generic directed embeddings of n-arc directed bouquets (see Links for the details). - Andrei Zabolotskii, Jan 20 2026
LINKS
Robert Coquereaux and Jean-Bernard Zuber, Maps, immersions and permutations, Journal of Knot Theory and Its Ramifications, Vol. 25, No. 8 (2016), 1650047; arXiv preprint, arXiv:1507.03163 [math.CO], 2015-2016. See Table 9, line UOc total.
Mark N. Ellingham and Joanna A. Ellis-Monaghan, A Catalog of Enumeration Formulas for Bouquet and Dipole Embeddings under Symmetries, Symmetry 2022, 14(9), 1793. See (A6).
Andrei Zabolotskii, Immersed curves and embedded bouquets
FORMULA
a(n) = (A268562(n) + [n is odd] * A098560((n-1)/2)) / 2. [Ellingham and Ellis-Monaghan] - Andrei Zabolotskii, Dec 03 2025
PROG
(SageMath)
def aI(n, k): return sum(euler_phi(n/g) * factorial(g) * (k*n/g)^g for g in divisors(n)) / n
def aR(n, k): return n%2 and factorial(n//2) * 2^(n//2) * k^((n+1)/2)
def a(n): return (aI(n, 2) + aR(n, 2))/2 if n else 1 # Andrei Zabolotskii, Dec 03 2025
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Mar 02 2016
EXTENSIONS
Name clarified by Andrei Zabolotskii, Jun 09 2024
a(0) and a(10) onward from Andrei Zabolotskii, Jan 20 2026
STATUS
approved
