a(n) is the greatest possible length of a circular sequence on n symbols such that: no two adjacent symbols are the same, any group of n adjacent symbols contains at least n-1 different symbols, and all groups of n adjacent symbols within the sequence are unique.
A382411
a(n) is the greatest possible length of a circular sequence on n symbols such that: no two adjacent symbols are the same, any group of n adjacent symbols contains at least n-1 different symbols, and all groups of n adjacent symbols within the sequence are unique.
Terms
- a(0) =1a(1) =2a(2) =12a(3) =96a(4) =840a(5) =7920a(6) =80640a(7) =887040a(8) =10523520a(9) =134265600a(10) =1836172800a(11) =26824089600a(12) =417210393600
External references
- oeis: A382411