OFFSET
4,1
COMMENTS
Let a(n) be the number of bracelets of length 4 using exactly 4 colors, where the colors are chosen from a set of size N = A000081(n) (unlabeled rooted trees with n nodes). For a fixed set of 4 colors, there are 24 linear arrangements and the dihedral group D4 has 8 elements, giving 24/8 = 3 distinct bracelets per color set. Hence a(n) = 3 * binomial(N,4).
FORMULA
a(n) = 3 * binomial(A000081(n), 4) for n >= 4.
EXAMPLE
For n=4, N = A000081(4) = 4 colors (A, B, C, D). The 3 bracelets are:
(1) A B C D
(2) A B D C
(3) A C B D
All rotations and reflections are considered identical.
PROG
(Python)
from math import comb
from functools import lru_cache
@lru_cache(maxsize=None)
def A000081(n):
if n <= 1:
return 1
total = 0
for j in range(1, n):
s = 0
for d in range(1, j + 1):
if j % d == 0:
s += d * A000081(d)
total += s * A000081(n - j)
return total // (n - 1)
def a(k):
return 3 * comb(A000081(k), 4)
print([a(k) for k in range(4, 21)])
CROSSREFS
KEYWORD
nonn
AUTHOR
Chen Wei-Shi, May 28 2026
STATUS
approved
