The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A134365 In base 2 the least number of positive numbers of (1+n) digits in which it can be read the totality of the 2^(n-1) positive numbers of n digits (0 excluded). 0
 1, 1, 3, 5, 10, 20, 44 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS EXAMPLE The unique number 1 of 1 digit can be read in 1 number of 2 digits = 10, hence c(n) = 1. The 2 numbers of 2 digits 10 and 11 can be read in 1 number of 3 digits = 110, hence c(2)=1. The four numbers of 3 digits 100,101,110,111 need 3 digits of 4 digits : e.g 1000 (100)1010(101)1110 (110 and 111); 2 numbers are not enough because 1010 for example contains only one number of 3 digits and for the second reason that 1100 and 1101 contain each the number 110. CROSSREFS Sequence in context: A270737 A270724 A018104 * A076862 A107129 A037183 Adjacent sequences:  A134362 A134363 A134364 * A134366 A134367 A134368 KEYWORD base,easy,nonn AUTHOR Philippe Lallouet (philip.lallouet(AT)orange.fr), Jan 17 2008 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.

Last modified January 18 01:10 EST 2022. Contains 350410 sequences. (Running on oeis4.)