|
Search: id:A061279
|
|
|
| A061279 |
|
Sum_{k >= 0} 2^k*binomial(k+2,n-2*k). |
|
+0
4
|
|
| 1, 2, 3, 6, 10, 18, 32, 56, 100, 176, 312, 552, 976, 1728, 3056, 5408, 9568, 16928, 29952, 52992, 93760, 165888, 293504, 519296, 918784, 1625600, 2876160, 5088768, 9003520, 15929856, 28184576, 49866752, 88228864, 156102656
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
a(n) counts (binary) bit strings of length n in which no odd length block of 0's is followed by an odd length block of 1's. - Len Smiley (smiley(AT)math.uaa.alaska.edu), Nov 23 2001
|
|
REFERENCES
|
I. P. Goulden and D. M. Jackson, Combinatorial Enumeration, Wiley, N.Y., 1983,(2.4.6).
|
|
FORMULA
|
G.f.: (1+x)^2/(1-2*x^2-2*x^3).
|
|
CROSSREFS
|
Sequence in context: A011957 A019436 A147852 this_sequence A018073 A052972 A018166
Adjacent sequences: A061276 A061277 A061278 this_sequence A061280 A061281 A061282
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Vladeta Jovovic (vladeta(AT)eunet.rs), Jun 04 2001
|
|
EXTENSIONS
|
More terms from Frank.Ellermann(AT)t-online.de, Jun 13 2001
|
|
|
Search completed in 0.007 seconds
|
