OFFSET
1,4
COMMENTS
a(n) counts distinct sequences of beads chosen to be replaced, up to rotation and reflection before the replacement. A397015 instead counts distinct sequences of necklaces after replacement. The current sequence is larger at n=9, 12, 15, 16, ... because it is possible for distinct beads to be chosen and result in the same necklace. E.g. BBWBWWBWW has 5 distinct white beads but only 4 resulting necklaces; replacing the 2nd white bead creates BBWBBWBWW, whereas replacing the 4th white bead creates BBWBWWBBW which is equivalent after rotation. - D. S. McNeil and Martin Fuller, Jun 13 2026
REFERENCES
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
Martin Fuller, Table of n, a(n) for n = 1..35
H. W. Gould, Letters to N. J. A. Sloane, 1974.
D. E. Knuth, Computer science and its relation to mathematics, Amer. Math. Monthly, 81 (1974), 323-343. doi: 10.2307/2318994.
D. E. Knuth, H. Wilf, C. L. Mallows, & D. Klarner, Correspondence, 1994,
CROSSREFS
KEYWORD
nonn,nice,changed
AUTHOR
EXTENSIONS
Corrected and extended by Don Knuth, Nov 15 1995
a(21) onward from Martin Fuller, Jun 13 2026
STATUS
approved
