cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A089741 Triangle read by rows: T(n,k) = number of peakless Motzkin paths of length n containing k UHH...HD's, where U=(1,1), D=(1,-1) and H=(1,0) (can be easily expressed using RNA secondary structure terminology).

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 3, 1, 7, 1, 15, 1, 1, 31, 5, 1, 63, 18, 1, 127, 56, 1, 1, 255, 160, 7, 1, 511, 432, 34, 1, 1023, 1120, 138, 1, 1, 2047, 2816, 500, 9, 1, 4095, 6912, 1672, 55, 1, 8191, 16640, 5264, 275, 1, 1, 16383, 39424, 15808, 1205, 11, 1, 32767, 92160, 45696, 4797
Offset: 0

Views

Author

Emeric Deutsch, Jan 08 2004

Keywords

Examples

			T(7,2)=5 because we have H(UHD)(UHD), (UHD)H(UHD), (UHD)(UHD)H, (UHD)(UHHD) and (UHHD)(UHD) (the required subwords are shown between parentheses).
Triangle begins:
  1;
  1;
  1;
  1,   1;
  1,   3;
  1,   7;
  1,  15,   1;
  1,  31,   5;
  1,  63,  18;
  1, 127,  56,   1;
  1, 255, 160,   7;
  ...
		

Crossrefs

Row sums yield A004148. Column 1 is A000225, column 2 is A001793.

Formula

G.f.: (1-2*z+2*z^2-t*z^3-sqrt((1-t*z^3)*(1-4*z+4*z^2-t*z^3)))/(2*z^2*(1-z)).