|
|
A213464
|
|
T(n,k)=Number of 0..3 arrays of length n+2*k-1 with sum less than 3*k in any length 2k subsequence (=less than 50% duty cycle)
|
|
14
|
|
|
6, 106, 14, 1758, 310, 31, 28722, 5542, 927, 70, 466136, 94238, 18018, 2735, 157, 7536790, 1568984, 319078, 58898, 7803, 353, 121573668, 25829770, 5444644, 1091036, 191573, 22506, 793, 1957953138, 422335348, 91147915, 19105020, 3737885
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Table starts
....6....106....1758.....28722.....466136.....7536790....121573668
...14....310....5542.....94238....1568984....25829770....422335348
...31....927...18018....319078....5444644....91147915...1508740928
...70...2735...58898...1091036...19105020...325333429...5451265872
..157...7803..191573...3737885...67329406..1167362677..19808276303
..353..22506..615561..12773955..237475982..4198162231..72188618371
..793..65425.1940673..43399990..836356119.15103463125.263422708979
.1782.190318.6155514.146145812.2935825527.54284048195.961420842175
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=3 k=4
..2....0....2....0....0....0....2....0....0....2....0....0....0....2....0....0
..2....2....0....2....1....2....2....0....0....0....0....1....1....2....2....0
..2....1....0....0....0....3....0....0....0....0....0....2....0....1....1....0
..1....3....1....1....0....0....0....2....0....0....2....0....0....1....1....1
..1....1....1....3....2....0....2....2....0....3....3....0....0....1....0....2
..0....1....3....1....2....2....1....2....0....0....0....0....0....2....2....0
..1....0....0....0....1....0....1....0....0....0....1....0....2....1....1....1
..1....1....0....0....1....0....3....0....0....2....0....2....2....0....2....2
..2....0....2....1....3....0....2....1....2....2....1....0....2....2....2....2
..3....3....0....3....0....2....1....3....2....3....2....0....2....1....1....2
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|