login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A050186 Triangular array T read by rows: T(h,k)=number of binary words of k 1's and h-k 0's which are not a juxtaposition of 2 or more identical subwords. 13
1, 1, 1, 0, 2, 0, 0, 3, 3, 0, 0, 4, 4, 4, 0, 0, 5, 10, 10, 5, 0, 0, 6, 12, 18, 12, 6, 0, 0, 7, 21, 35, 35, 21, 7, 0, 0, 8, 24, 56, 64, 56, 24, 8, 0, 0, 9, 36, 81, 126, 126, 81, 36, 9, 0, 0, 10, 40, 120, 200, 250, 200, 120, 40, 10, 0, 0, 11, 55, 165, 330, 462, 462, 330, 165, 55, 11 (list; table; graph; refs; listen; history; internal format)
OFFSET

0,5

LINKS

N. J. A. Sloane, Transforms

Index entries for triangles and arrays related to Pascal's triangle

FORMULA

MOEBIUS transform of A007318 Pascal's Triangle.

EXAMPLE

For example, T(4,2) counts 1100,1001,0011,0110; T(2,1) counts 10, 01 (hence also counts 1010, 0101).

Rows:

1;

1,1;

0,2,0;

0,3,3,0;

0,4,4,4,0;

0,5,10,10,5,0;

CROSSREFS

Same triangle as A053727 except this one includes column 0.

T(2n, n), T(2n+1, n) match A007727, A001700, respectively. Row sums match A027375.

Sequence in context: A195664 A053202 A188122 * A074734 A174956 A124182

Adjacent sequences:  A050183 A050184 A050185 * A050187 A050188 A050189

KEYWORD

nonn,tabl

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 04:59 EST 2012. Contains 205694 sequences.