

A119485


Number of children for which any subset can be generated by a countingout game.


1



1, 2, 3, 4, 5, 6, 7, 8, 10, 11, 13, 14, 16, 17, 19, 22, 23, 26, 29, 31, 32
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

The numbers were generated by an exhaustive search via a Cprogram.


LINKS

Table of n, a(n) for n=1..21.


FORMULA

Conjecture (by J. Fricke and G. Woeginger): The sequence contains exactly: powers of 2, primes and doubled primes.


EXAMPLE

Having 6 children 1,2,3,4,5,6, then the children 2,4,6 can be countedout by counting to 42: first selected child is 6, then 2 and finally 4.


CROSSREFS

Complement of A119486.
Sequence in context: A320058 A320057 A033106 * A058363 A049810 A132018
Adjacent sequences: A119482 A119483 A119484 * A119486 A119487 A119488


KEYWORD

more,nonn


AUTHOR

Jan Fricke (fricke(AT)math.unisiegen.de), May 23 2006, Jun 06 2006


STATUS

approved



