|
%I #5 Oct 29 2023 17:28:20
%S 1,2,3,4,5,6,7,8,10,11,13,14,16,17,19,22,23,26,29,31,32
%N Number of children for which any subset can be generated by a counting-out game.
%C The numbers were generated by an exhaustive search via a C-program.
%F Conjecture (by J. Fricke and G. Woeginger): The sequence contains exactly: powers of 2, primes and doubled primes.
%e Having 6 children 1,2,3,4,5,6, then the children 2,4,6 can be counted-out by counting to 42: first selected child is 6, then 2 and finally 4.
%Y Complement of A119486.
%K nonn,more
%O 1,2
%A _Jan Fricke_, May 23 2006
|
