Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A134365
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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, 1, 3, 5, 10, 20, 44 (list; graph; listen)
OFFSET

1,3

EXAMPLE

The unic 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 nead 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 on number of 3 digits and for the second reason that 1100 and 1101 contain each the number 110

CROSSREFS

Adjacent sequences: A134362 A134363 A134364 this_sequence A134366 A134367 A134368

Sequence in context: A018101 A068013 A018104 this_sequence A076862 A107129 A037183

KEYWORD

base,easy,nonn

AUTHOR

Philippe Lallouet (philip.lallouet(AT)orange.fr), Jan 17 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 11 09:12 EDT 2008. Contains 144832 sequences.


AT&T Labs Research