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 A119486 #6 Oct 29 2023 17:28:16 %S A119486 9,12,15,18,20,21,24,25,27,28,30,33 %N A119486 Numbers of children for which there is a subset which cannot be generated by a counting-out game. %C A119486 The numbers were generated by an exhaustive search via a C-program. %F A119486 Conjecture (by J. Fricke and G. Woeginger): The sequence contains all numbers n with an odd prime divisor p satisfying n/p>2. %e A119486 For 9 children 1,2,3,4,5,6,7,8,9, there is no possibility to select 3,4,6,7 (in any order) by a counting-out game, e.g. for selecting 3,4,6,7 the count-to number has to be 3 mod 9, 1 mod 8, 2 mod 7 and 1 mod 6, which is impossible. %Y A119486 Complement of A119485. %K A119486 nonn,more %O A119486 1,1 %A A119486 _Jan Fricke_, May 23 2006