login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

Number of 0..2 arrays of length n+11 with sum no more than 12 in any length 12 subsequence (=50% duty cycle)
1

%I #4 May 06 2012 19:31:43

%S 302615,808403,2204646,6062948,16740414,46305966,128148456,354470546,

%T 979272751,2700150083,7425872754,20355794336,55576133157,151888056136,

%U 415782103202,1139624300299,3126418458642,8581964181953,23565242287322

%N Number of 0..2 arrays of length n+11 with sum no more than 12 in any length 12 subsequence (=50% duty cycle)

%C Column 6 of A212232

%H R. H. Hardin, <a href="/A212230/b212230.txt">Table of n, a(n) for n = 1..122</a>

%e Some solutions for n=3

%e ..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0

%e ..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0

%e ..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0

%e ..1....1....1....2....0....1....0....0....0....0....0....1....1....0....0....1

%e ..1....1....1....0....0....0....2....1....2....1....0....2....0....1....1....0

%e ..0....2....1....0....1....1....2....1....1....0....2....1....0....1....0....1

%e ..2....0....2....2....0....1....0....0....1....1....0....0....1....2....2....1

%e ..2....1....1....1....2....1....1....2....0....0....1....1....1....2....1....2

%e ..1....2....0....2....2....2....0....2....0....1....2....0....0....0....1....0

%e ..0....0....0....1....1....0....0....0....0....2....0....1....0....2....1....1

%e ..1....1....2....2....1....0....1....1....1....2....1....0....0....1....0....2

%e ..1....1....1....0....2....1....0....2....2....1....0....0....2....1....0....2

%e ..1....2....2....0....0....2....1....0....0....0....0....2....1....0....1....1

%e ..0....1....0....2....1....2....0....1....0....1....0....2....0....1....2....1

%K nonn

%O 1,1

%A _R. H. Hardin_ May 06 2012