cp's OEIS Frontend

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.

Showing 1-1 of 1 results.

A119485 Number of children for which any subset can be generated by a counting-out game.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 10, 11, 13, 14, 16, 17, 19, 22, 23, 26, 29, 31, 32
Offset: 1

Views

Author

Jan Fricke, May 23 2006

Keywords

Comments

The numbers were generated by an exhaustive search via a C-program.

Examples

			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.

Formula

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

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.