The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A023652 Convolution of (F(2), F(3), F(4), ...) and odd numbers. 2
 1, 5, 14, 31, 61, 112, 197, 337, 566, 939, 1545, 2528, 4121, 6701, 10878, 17639, 28581, 46288, 74941, 121305, 196326, 317715, 514129, 831936, 1346161, 2178197, 3524462, 5702767, 9227341, 14930224, 24157685, 39088033, 63245846, 102334011, 165579993, 267914144, 433494281, 701408573 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS a(n) is the number of bit strings of length n+3 with the pattern 01 at least twice, and without the pattern 110, see example. [John M. Campbell, Jan 25 2013]. LINKS FORMULA a(n) = Fibonacci(n+6) - 4*n - 8. - Ralf Stephan, Feb 15 2004 EXAMPLE From John M. Campbell_, Jan 25 2013: (Start) There are a(3) = 14 bit strings of length 3+3 with the pattern 01 at least twice, and without the pattern 110: 000101, 001001, 001010, 001011, 010001, 010010, 010011, 010100, 010101, 010111, 100101, 101001, 101010, 101011 (End) CROSSREFS Sequence in context: A299903 A299276 A267167 * A283523 A101648 A265100 Adjacent sequences:  A023649 A023650 A023651 * A023653 A023654 A023655 KEYWORD nonn AUTHOR 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 May 9 16:32 EDT 2021. Contains 343742 sequences. (Running on oeis4.)