|
Search: id:A062257
|
|
|
| A062257 |
|
(0,1)-strings of length n not containing substrings 10101101 and 1110101. |
|
+0
3
|
|
| 1, 2, 4, 8, 16, 32, 64, 127, 251, 496, 981, 1940, 3837, 7590, 15015, 29704, 58763, 116249, 229971, 454942, 899991, 1780410, 3522102, 6967611, 13783703, 27267665, 53942368, 106711708, 211102869, 417615105, 826148769, 1634332138
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
REFERENCES
|
I. P. Goulden and D. M. Jackson, Combinatorial Enumeration, Wiley, N.Y., 1983,(Example 2.8.11).
|
|
FORMULA
|
G.f.: (1+x^5+x^6+x^7-x^9)/(1+x^5-x^6-x^9-2*x-x^8+x^10). a(n) = 2*a(n-1)-a(n-5)+a(n-6)+a(n-8)+a(n-9)-a(n-10).
|
|
CROSSREFS
|
Cf. A062258, A062259.
Sequence in context: A054044 A008859 A145113 this_sequence A062258 A066178 A122189
Adjacent sequences: A062254 A062255 A062256 this_sequence A062258 A062259 A062260
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Vladeta Jovovic (vladeta(AT)Eunet.yu), Jun 14 2001
|
|
|
Search completed in 0.002 seconds
|
