|
Search: id:A118648
|
|
|
| A118648 |
|
a(n) is the number of binary strings of length n+3 such that there exist a subsequence of length 4 with 2 ones in it. |
|
+0
1
|
|
| 11, 25, 54, 114, 237, 486, 988, 1998, 4027, 8097, 16253, 32587, 65286, 130727, 261668, 523631, 1047669, 2095900, 4192576, 8386223, 16773924, 33549888, 67102592, 134209071, 268423507, 536854419, 1073719059, 2147452226
(list; graph; listen)
|
|
|
OFFSET
|
4,1
|
|
|
COMMENT
|
a(n) = 2^(n+4) - sum of all elements of the n-th power of the matrix [[1 1 0 0 0] [0 0 1 0 0] [0 0 0 1 0] [0 0 0 0 1] [1 1 0 0 0]] which is the transition matrix for the last four bits being 0000, 0001, 0010, 0100, 1000. - Joshua Zucker (joshua.zucker(AT)stanfordalumni.org), Aug 04 2006
|
|
CROSSREFS
|
Sequence in context: A125868 A031025 A140675 this_sequence A105270 A039337 A043160
Adjacent sequences: A118645 A118646 A118647 this_sequence A118649 A118650 A118651
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Tanya Khovanova (tanyakh(AT)yahoo.com), May 10 2006
|
|
|
Search completed in 0.002 seconds
|
