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+7 with sum no more than 8 in any length 8 subsequence (=50% duty cycle)
1

%I #4 May 06 2012 19:29:38

%S 3834,10002,26637,71427,191853,514687,1376128,3659968,9662878,

%T 25562476,67800449,180120882,478897973,1273545563,3386125989,

%U 8999257525,23906208533,63493578634,168644397152,447996097328,1190222549456

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

%C Column 4 of A212232

%H R. H. Hardin, <a href="/A212228/b212228.txt">Table of n, a(n) for n = 1..210</a>

%e Some solutions for n=3

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

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

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

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

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

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ May 06 2012