OFFSET
0,4
COMMENTS
The sequence counts row lengths of an array in which rows are obtained by the substitution 1->2, 2->3, 3->1,2,2,3 from previous rows:
1;
2;
3;
1,2,2,3;
2,3,3,1,2,2,3;
3,1,2,2,3,1,2,2,3,2,3,3,1,2,2,3;
LINKS
Robert Israel, Table of n, a(n) for n = 0..303
Index entries for linear recurrences with constant coefficients, signature (1,2,1).
FORMULA
a(n) = a(n-1) + 2*a(n-2) + a(n-3), starting 1,1,1.
a(n) = sum(m=0..n/2, sum(i=0..m, 2^i*binomial(n-2*m+1,m-i)*binomial(n-2*m+i,n-2*m))). - Vladimir Kruchinin, Dec 17 2011
MAPLE
a[0], a[1], a[2]:= 1, 1, 1:
for n from 3 to 100 do
a[n]:= a[n-1]+2*a[n-2]+a[n-3]
od:
seq(a[i], i=0..100); # Robert Israel, Jun 15 2014
MATHEMATICA
s[1] = {2}; s[2] = {3}; s[3] = {1, 2, 2, 3}; t[a_] := Flatten[s /@ a]; p[0] = {1}; p[1] = t[p[0]]; p[n_] := t[p[n - 1]] a0 = Table[Length[p[i]], {i, 0, 20}]
f[n_] := Sum[ 2^i*Binomial[n - 2 m, m - i]*Binomial[n - 2 m + i - 1, n - 2 m - 1], {m, 0, (n - 1)/2}, {i, 0, m}]; f[0] = 1; Array[f, 33, 0] (* or *)
CoefficientList[ Series[(1 - 2 x^2)/(1 - x - 2 x^2 - x^3), {x, 0, 33}], x] (* or *)
LinearRecurrence[ {1, 2, 1}, {1, 1, 1}, 34] (* or *)
Length /@ NestList[ Flatten[ # /. {1 -> 2, 2 -> 3, 3 -> {1, 2, 2, 3}}] &, {1}, 24] (* Robert G. Wilson v, Jun 13 2014 *)
PROG
(Maxima)
a(n):=sum(sum(2^i*binomial(n-2*m+1, m-i)*binomial(n-2*m+i, n-2*m), i, 0, m), m, 0, (n)/2); /* Vladimir Kruchinin, Dec 17 2011 */
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Roger L. Bagula, Jun 04 2005
EXTENSIONS
More terms from Wesley Ivan Hurt, Jun 14 2014
STATUS
approved