login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A119485 Number of children for which any subset can be generated by a counting-out 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 C-program.

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 counted-out 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.uni-siegen.de), May 23 2006, Jun 06 2006

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 20 05:45 EST 2020. Contains 331067 sequences. (Running on oeis4.)