This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A361837 #16 May 11 2025 01:17:29 %S A361837 3,4,6,9,10,13,16,20,27 %N A361837 Maximum cardinality of trifferent codes with length n. %C A361837 (9/5)^(n/4) <= a(n) <= 2*(3/2)^n. %H A361837 Anurag Bishnoi, <a href="https://anuragbishnoi.wordpress.com/2023/01/23/the-trifference-problem/">The Trifference Problem</a>. %H A361837 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). %H A361837 Sascha Kurz, <a href="https://doi.org/10.1016/j.exco.2024.100139">Trifferent codes with small lengths</a>, Examples and Counterexamples, 5 (2024). %K A361837 nonn,hard,more %O A361837 1,1 %A A361837 _Lorenzo Sauras Altuzarra_, Mar 26 2023 %E A361837 a(7)-a(9), from Kurz link, added by _Bert Dobbelaere_, May 11 2025