|
Search: id:A027557
|
|
|
| A027557 |
|
Number of 3-balanced strings of length n: let d(S)= #(1)'s in S - #(0)'s, then S is k-balanced if every substring T has -k<=d(T)<=k; here k=3. |
|
+0
2
|
|
| 1, 2, 4, 8, 14, 26, 44, 78, 130, 224, 370, 626, 1028, 1718, 2810, 4656, 7594, 12506, 20356, 33374, 54242, 88640, 143906, 234594, 380548, 619238, 1003882, 1631312, 2643386, 4291082, 6950852, 11274702, 18258322, 29598560
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
FORMULA
|
a_n = a_{n-1} + 3a_{n-2} - 2a_{n-3} - 2a_{n-4}; g.f. (1+x-x^2) / (1-x-x^2)(1-2x^2).
a(n) = 2*A000045(n+3) - 2^floor((n+2)/2) - 2^floor((n+1)/2) - Max Alekseyev (maxale(AT)gmail.com), Jun 02 2005
|
|
PROGRAM
|
(PARI) a(n) = 2*fibonacci(n+3) - 2^((n+2)\2) - 2^((n+1)\2) (Alekseyev)
|
|
CROSSREFS
|
Sequence in context: A065492 A006777 A036609 this_sequence A120545 A130708 A054193
Adjacent sequences: A027554 A027555 A027556 this_sequence A027558 A027559 A027560
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
R. K. Guy (rkg(AT)cpsc.ucalgary.ca), callan(AT)bayes.stat.wisc.edu (David Callan)
|
|
|
Search completed in 0.002 seconds
|
