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 A228652 #14 Jul 29 2022 16:51:28 %S A228652 1,2,3,5,7,15,19,27,31,47 %N A228652 Numbers m such that if an urn contains m balls, with at least one each of c colors, there is no c > 1 for which a combination of c colors exists such that it is equally probable for c balls randomly selected from the urn to all be either the same color or distinct colors. %C A228652 Is this sequence finite and complete? %H A228652 William Rex Marshall, <a href="/A228652/a228652.txt">Pascal program</a>. %o A228652 (Pascal) See the link section. %Y A228652 Cf. A228650, A228651, A228653. %K A228652 nonn %O A228652 1,2 %A A228652 _William Rex Marshall_, Aug 29 2013