Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A145116
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A145116 Numbers of length n binary words with fewer than 8 0-digits between any pair of consecutive 1-digits. +0
2
1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1023, 2043, 4079, 8143, 16255, 32447, 64767, 129279, 258047, 515072, 1028102, 2052126, 4096110, 8175966, 16319486, 32574206, 65019134, 129780222, 259045373, 517062645, 1032073165, 2060050221 (list; graph; listen)
OFFSET

0,2

FORMULA

G.f.: (1-x+x^9)/(1-3*x+2*x^2+x^9-x^10).

EXAMPLE

a(10) = 1023 = 2^10-1, because 1000000001 is the only binary word of length 10 with not less than 8 0-digits between any pair of consecutive 1-digits.

MAPLE

a:= n-> (Matrix([[2, 1$9]]). Matrix(10, (i, j)-> if i=j-1 then 1 elif j=1 then [3, -2, 0$6, -1, 1][i] else 0 fi)^n)[1, 2]: seq (a(n), n=0..35);

CROSSREFS

8th column of A145111.

Sequence in context: A009714 A051535 A008862 this_sequence A122265 A113010 A056767

Adjacent sequences: A145113 A145114 A145115 this_sequence A145117 A145118 A145119

KEYWORD

nonn

AUTHOR

Alois P. Heinz (heinz(AT)hs-heilbronn.de), Oct 02 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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research