login
A361837
Maximum cardinality of trifferent codes with length n.
0
3, 4, 6, 9, 10, 13
OFFSET
1,1
COMMENTS
(9/5)^(n/4) <= a(n) <= 2*(3/2)^n.
LINKS
Anurag Bishnoi, The Trifference Problem.
Stefano Della Fiore, Alessandro Gnutti and Sven Polak, The maximum cardinality of trifferent codes with lengths 5 and 6, Examples and Counterexamples, 2 (2022).
CROSSREFS
Sequence in context: A047231 A050131 A332023 * A191326 A191185 A089986
KEYWORD
nonn,hard,more
AUTHOR
STATUS
approved