OFFSET
0,2
COMMENTS
The degree of asymmetry of a finite sequence of numbers is defined to be the number of pairs of symmetrically positioned distinct entries. Example: the degree of asymmetry of (2,7,6,4,5,7,3) is 2, counting the pairs (2,3) and (6,5).
A sequence is palindromic if and only if its degree of asymmetry is 0.
Number of entries in row n is 1+floor(n/2).
Sum of entries in row n is A000045(n+2) (Fibonacci).
T(n,0) = A053602(n+2) (= number of palindromic 00-avoiding binary words of length n).
Sum(k*T(n,k), k>=0) = A275436(n).
FORMULA
G.f.: G(t,z) = (1 + 2z + tz^2 +z^3 -tz^5)/(1 - z^2 - tz^2 - z^4 - tz^4 + tz^6).
EXAMPLE
Row 3 is [3,2] because the 00-avoiding binary words of length 3 are 010, 011, 101, 110, 111, having asymmetry degrees 0, 1, 0, 1, 0, respectively.
Triangle starts:
1;
2;
1,2;
3,2;
2,4,2;
5,6,2.
MAPLE
G := (1+2*z+t*z^2+z^3-t*z^5)/(1-z^2-t*z^2-z^4-t*z^4+t*z^6): Gser := simplify(series(G, z = 0, 20)): for n from 0 to 18 do P[n] := sort(coeff(Gser, z, n)) end do: for n from 0 to 18 do seq(coeff(P[n], t, j), j = 0 .. (1/2)*n) end do; # yields sequence in triangular form
MATHEMATICA
Table[BinCounts[#, {0, Floor[n/2] + 1, 1}] &@ Map[Total@ BitXor[Take[#, Ceiling[Length[#]/2]], Reverse@ Take[#, -Ceiling[Length[#]/2]]] &, Select[PadLeft[IntegerDigits[#, 2], n] & /@ Range[0, 2^n - 1], Length@ SequenceCases[#, {0, 0}] == 0 &]], {n, 0, 15}] // Flatten (* Michael De Vlieger, Aug 15 2016, Version 10.1 *)
CROSSREFS
KEYWORD
nonn,tabf
AUTHOR
Emeric Deutsch, Aug 15 2016
STATUS
approved