|
|
A351356
|
|
Triangle read by rows T(n,k): number of binary necklaces with n beads, k of them black, and at least two consecutive black beads.
|
|
6
|
|
|
0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 2, 1, 1, 0, 0, 1, 3, 3, 1, 1, 0, 0, 1, 4, 5, 3, 1, 1, 0, 0, 1, 5, 9, 7, 4, 1, 1, 0, 0, 1, 6, 13, 14, 10, 4, 1, 1, 0, 0, 1, 7, 19, 25, 22, 12, 5, 1, 1, 0, 0, 1, 8, 25, 41, 42, 30, 15, 5, 1, 1, 0, 0, 1, 9, 33, 63, 79, 66, 43, 19, 6, 1, 1, 0, 0, 1, 10, 41, 92, 131, 132, 99, 55, 22, 6, 1, 1
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,18
|
|
LINKS
|
|
|
EXAMPLE
|
Triangle begins:
0;
0, 0;
0, 1, 0;
0, 1, 1, 0;
0, 1, 1, 1, 0;
0, 1, 2, 1, 1, 0;
0, 1, 3, 3, 1, 1, 0;
0, 1, 4, 5, 3, 1, 1, 0;
0, 1, 5, 9, 7, 4, 1, 1, 0;
...
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|