A119486 Numbers of children for which there is a subset which cannot be generated by a counting-out game.
9, 12, 15, 18, 20, 21, 24, 25, 27, 28, 30, 33
Offset: 1
Examples
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.
Crossrefs
Complement of A119485.
Formula
Conjecture (by J. Fricke and G. Woeginger): The sequence contains all numbers n with an odd prime divisor p satisfying n/p>2.
Comments