|
|
A132297
|
|
Number of distinct Markov type classes of order 2 possible in binary strings of length n.
|
|
4
|
|
|
4, 7, 12, 18, 26, 35, 46, 58, 72, 87, 104, 122, 142, 163, 186, 210, 236, 263, 292
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
2,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
Conjectures:
a(n) = (15+(-1)^n-4*n+6*n^2)/8.
a(n) = 2*a(n-1)-2*a(n-3)+a(n-4).
G.f.: -x^2*(2*x^3-2*x^2-x+4) / ((x-1)^3*(x+1)). (End)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
Lav R. Varshney (lrv(AT)mit.edu), Aug 17 2007
|
|
STATUS
|
approved
|
|
|
|