login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

Maximum cardinality of trifferent codes with length n.
0

%I #10 Apr 01 2023 23:57:42

%S 3,4,6,9,10,13

%N Maximum cardinality of trifferent codes with length n.

%C (9/5)^(n/4) <= a(n) <= 2*(3/2)^n.

%H Anurag Bishnoi, <a href="https://anuragbishnoi.wordpress.com/2023/01/23/the-trifference-problem/">The Trifference Problem</a>.

%H Stefano Della Fiore, Alessandro Gnutti and Sven Polak, <a href="https://doi.org/10.1016/j.exco.2022.100051">The maximum cardinality of trifferent codes with lengths 5 and 6</a>, Examples and Counterexamples, 2 (2022).

%K nonn,hard,more

%O 1,1

%A _Lorenzo Sauras Altuzarra_, Mar 26 2023